Sciweavers

2861 search results - page 31 / 573
» Constraint Programming
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
CPAIOR
2005
Springer
15 years 3 months ago
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price
Producing work schedules for airline crew normally results in individually different schedules. Some airlines do however want to give the same schedule to groups of people. The con...
Jesper Hansen, Tomas Lidén
99
Voted
CP
1999
Springer
15 years 2 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
AAAI
2004
14 years 11 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
CORR
2006
Springer
110views Education» more  CORR 2006»
14 years 9 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij