CPAIOR
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
CPAIOR
2004
Springer
13 years 8 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
We describe using Case Based Reasoning to explore structure at the instance level as a means to distinguish whether to use CP or IP to solve instances of the Bid Evaluation Problem...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
