Sciweavers

88 search results - page 13 / 18
» cp 2008
Sort
View
EAAI
2008
101views more  EAAI 2008»
13 years 8 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
CONSTRAINTS
2006
83views more  CONSTRAINTS 2006»
13 years 8 months ago
Applying Ad-hoc Global Constraints with the case Constraint to Still-Life
Abstract. The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this pape...
Kenil C. K. Cheng, Roland H. C. Yap
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 8 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CP
2005
Springer
14 years 2 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker