Sciweavers

230 search results - page 3 / 46
» Constraint Orbital Branching
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 5 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
AAAI
1996
13 years 6 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
CPAIOR
2005
Springer
13 years 10 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
LOGCOM
1998
80views more  LOGCOM 1998»
13 years 4 months ago
Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus
The Situation Calculus is a logic of time and change in which there is a distinguished initial situation ¡£¢ and all other situations arise from the different sequences of acti...
Javier Pinto