Achieving domain consistency and counting solutions for dispersion constraints
Year of publication: |
2015
|
---|---|
Authors: | Pesant, Gilles |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 4, p. 690-703
|
Subject: | combinatorial optimization | constraint programming | balance | spread constraint | deviation constraint | filtering algorithms | branching heuristics | counting-based search | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
-
Esmaelian, Majid, (2021)
-
A memetic algorithm for the Minimum Sum Coloring Problem
Jin, Yan, (2014)
- More ...
-
Using local search to speed up filtering algorithms for some NP-hard constraints
Galinier, Philippe, (2011)
-
Feasibility of the pickup and delivery problem with fixed partial routes : a complexity analysis
Berbeglia, Gerardo, (2012)
-
The synchronized dynamic vehicle dispatching problem
Rousseau, Louis-Martin, (2013)
- More ...