A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming.
Ionut D. AronDaniel H. LeventhalMeinolf SellmannPublished in: CPAIOR (2006)
Keyphrases
- constraint programming
- totally unimodular
- extreme points
- convex hull
- combinatorial problems
- constraint satisfaction problems
- constraint propagation
- constraint satisfaction
- global constraints
- symmetry breaking
- integer programming
- column generation
- search strategies
- arc consistency
- finite number
- search heuristics
- mixed integer
- constraint solving
- geometric properties
- machine learning
- knapsack problem
- feasible solution
- constraint solver
- mathematical model
- learning algorithm