850 search results - page 59 / 170 » Constraint propagation on quadratic constraints |
IJCAI
2001
13 years 10 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
SARA
2009
Springer
14 years 3 months ago
2009
Springer
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhan...
CP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
CP
1999
Springer
14 years 1 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
HEURISTICS
2002
13 years 8 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...