Sciweavers

COR
2006
99views more  COR 2006»
13 years 4 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
COR
2006
92views more  COR 2006»
13 years 4 months ago
Variable neighborhood search for the linear ordering problem
Carlos G. García-González, Dionisio ...
COR
2006
64views more  COR 2006»
13 years 4 months ago
A constraint programming approach to cutset problems
François Fages, Akash Lal
COR
2006
65views more  COR 2006»
13 years 4 months ago
On-line resources allocation for ATM networks with rerouting
Samir Loudni, Patrice Boizumault, Philippe David
COR
2006
118views more  COR 2006»
13 years 4 months ago
Accelerating column generation for aircraft scheduling using constraint propagation
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
Mattias Grönkvist
COR
2006
79views more  COR 2006»
13 years 4 months ago
Sweep synchronization as a global propagation mechanism
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the...
Nicolas Beldiceanu, Mats Carlsson, Sven Thiel
COR
2006
120views more  COR 2006»
13 years 4 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
COR
2006
83views more  COR 2006»
13 years 4 months ago
Modelling and solving English Peg Solitaire
Peg Solitaire is a well known puzzle which can prove difficult despite its simple rules. Pegs are arranged on a board such that at least one `hole' remains. By making draught...
Christopher Jefferson, Angela Miguel, Ian Miguel, ...
COR
2006
98views more  COR 2006»
13 years 4 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve