9 search results - page 2 / 2 » csclp 2005 |
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
CSCLP
2005
Springer
13 years 7 months ago
2005
Springer
“Heuristic synergy” refers to improvements in search performance when the decisions made by two or more heuristics are combined. This paper considers combinations based on prod...