Sciweavers

2974 search results - page 71 / 595
» Model-Driven Constraint Programming
Sort
View
CPAIOR
2010
Springer
15 years 5 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
153
Voted
ISIP
2008
IEEE
16 years 29 days ago
An Approach Towards the Integration of Adaptive Business Intelligent and Constraint Programming
Adaptive Business Intelligence is the discipline that combines prediction, optimization and adaptability into a system answering two important questions: What would probably happe...
José Miguel Rubio, Broderick Crawford
CSCLP
2005
Springer
16 years 2 days 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
16 years 8 hour 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