


default search action
Constraints, Volume 20
Volume 20, Number 1, January 2015
- Alessandro Cimatti

, Andrea Micheli
, Marco Roveri
:
Solving strong controllability of temporal problems with uncertainty using SMT. 1-29 - Yves Caniou, Philippe Codognet, Florian Richoux, Daniel Diaz

, Salvador Abreu
:
Large-scale parallelism for constraint-based local search: the costas array case study. 30-56 - Steven D. Prestwich, S. Armagan Tarim

, Roberto Rossi
, Brahim Hnich
:
Hybrid metaheuristics for stochastic constraint programming. 57-76 - Gilles Simonin

, Christian Artigues, Emmanuel Hebrard
, Pierre Lopez:
Scheduling scientific experiments for comet exploration. 77-99 - Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap:

Improving the lower bound of simple tabular reduction. 100-108
Volume 20, Number 2, April 2015
- Arnaud Lallouet, Jimmy Ho-Man Lee, Terrence W. K. Mak

, Justin Yip:
Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction. 109-154 - Geoffrey Chu, Peter J. Stuckey:

Dominance breaking constraints. 155-182 - Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu:

Synchronized sweep algorithms for scalable scheduling constraints. 183-234 - Christopher Mears, Maria Garcia de la Banda

, Mark Wallace
, Bart Demoen:
A method for detecting symmetries in constraint models and its generalisation. 235-273 - Jimmy Ho-Man Lee, Pedro Meseguer, Wen Su:

Adding laziness in BnB-ADOPT+. 274-282
Volume 20, Number 3, July 2015
- Laurent Michel:

Introduction to the fast track issue for CPAIOR 2015. 283-284 - Victor Pillac, Manuel Cebrián

, Pascal Van Hentenryck:
A column-generation approach for joint mobilization and evacuation planning. 285-303 - Margaux Nattaf

, Christian Artigues, Pierre Lopez:
A hybrid exact method for a scheduling problem with a continuous resource and energy constraints. 304-324 - Gustav Björdal

, Jean-Noël Monette
, Pierre Flener
, Justin Pearson:
A constraint-based local search backend for MiniZinc. 325-345 - David Bergman, André Augusto Ciré

, Willem-Jan van Hoeve:
Lagrangian bounds from decision diagrams. 346-361 - Hadrien Cambazard, Jean-Guillaume Fages

:
New filtering for AtMostNValue and its weighted variant: A Lagrangian approach. 362-380
Volume 20, Number 4, October 2015
- Éric Grégoire, Bertrand Mazure:

Introduction to the special issue on CSP technologies in artificial intelligence. 381-382 - Achref El Mouelhi, Philippe Jégou, Cyril Terrioux:

A hybrid tractable class for non-binary CSPs. 383-413 - Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure:

On getting rid of the preprocessing minimization step in MUC-finding algorithms. 414-432 - Luis Quesada, Lanny Sitanayah

, Kenneth N. Brown
, Barry O'Sullivan
, Cormac J. Sreenan:
A constraint programming approach to the additional relay placement problem in wireless sensor networks. 433-451 - Bertrand Neveu, Gilles Trombettoni, Ignacio Araya

:
Adaptive constructive interval disjunction: algorithms and experiments. 452-467 - Guido Tack, Christopher Mears:

PhD theses in constraints 2012-2015. 468 - Ruben Martins:

Parallel search for maximum satisfiability. 469-470 - Thi Hong Hiep Nguyen, Thomas Schiex, Christian Bessiere:

Strong consistencies for weighted constraint satisfaction problems. 471-472 - Tommaso Urli:

Hybrid meta-heuristics for combinatorial optimization. 473 - Yuri Malitsky:

Instance-specific algorithm configuration. 474 - Serdar Kadioglu

:
Efficient search procedures for solving combinatorial problems. 475-476 - Jun He

:
Constraints for membership in formal languages under systematic search and stochastic local search. 477-478 - Mohamed Siala

:
Search, propagation, and learning in sequencing and scheduling problems. 479-480 - Lars Kotthoff:

On Algorithm Selection, with an application to combinatorial search problems. 481-482 - Roberto Amadini:

Portfolio approaches in constraint programming. 483 - Anastasia Paparrizou:

Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. 484-485 - David Bergman:

New techniques for discrete optimization. 486-487 - Jacopo Mauro:

Constraints meet concurrency. 488-489 - Carleton Coffrin:

Decision support for disaster management through hybrid optimization. 490-491 - Tias Guns

:
Declarative pattern mining using constraint programming. 492-493 - André Augusto Ciré:

Decision diagrams for optimization. 494-495 - Marc Pujol-Gonzalez:

Scaling DCOP algorithms for cooperative multi-agent coordination. 496-497 - Jean-Guillaume Fages

:
On the use of graphs within constraint-programming. 498-499 - András Z. Salamon:

Transformations of representation in constraint satisfaction. 500-501 - Laura Climent

:
Robustness and stability in dynamic constraint satisfaction problems. 502-503 - Norbert Manthey:

Towards next generation sequential and parallel SAT solvers. 504-505 - Roger Kameugne

:
Propagation techniques of resource constraint for cumulative scheduling. 506-507 - Farshid Hassani Bijarbooneh

:
Constraint programming for wireless sensor networks. 508 - Elsa Carvalho:

Probabilistic constraint reasoning. 509-510

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














