Sciweavers

673 search results - page 19 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
HM
2007
Springer
120views Optimization» more  HM 2007»
14 years 1 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
CP
2005
Springer
14 years 1 months ago
Dimensioning an Inbound Call Center Using Constraint Programming
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouq...
CPAIOR
2010
Springer
14 years 10 days ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ICRA
1995
IEEE
122views Robotics» more  ICRA 1995»
13 years 11 months ago
Actuator Constraints in Optimal Motion Planning of Manipulators
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
Patrick Plédel, Yasmina Bestaoui