A constraint programming primer
Year of publication: |
2014
|
---|---|
Authors: | Pesant, Gilles |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 2.2014, 3, p. 89-97
|
Subject: | Constraint programming | Combinatorial optimization | Inference | Search heuristic | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory |
-
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles, (2015)
-
Solving variants of the job shop scheduling problem through conflict-directed search
Grimes, Diarmuid, (2015)
-
Brandt, Felix, (2013)
- More ...
-
Using local search to speed up filtering algorithms for some NP-hard constraints
Galinier, Philippe, (2011)
-
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles, (2015)
-
Feasibility of the pickup and delivery problem with fixed partial routes : a complexity analysis
Berbeglia, Gerardo, (2012)
- More ...