On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables.
Hermann SchichlArnold NeumaierMihály Csaba MarkótFerenc DomesPublished in: CPAIOR (2013)
Keyphrases
- constraint satisfaction problems
- mixed integer
- constraint problems
- finite domain
- constraint satisfaction
- configuration problems
- linear programming problems
- constraint propagation
- continuous variables
- constraint programming
- integer variables
- linear program
- convex hull
- partial constraint satisfaction
- lot sizing
- soft constraints
- np complete
- variable ordering heuristics
- feasible solution
- np hard
- solving constraint satisfaction problems
- cutting plane
- quadratic program
- arc consistency
- optimal solution
- finding optimal solutions
- search space
- dynamic constraint satisfaction problems
- partial assignment
- combinatorial problems
- valid inequalities
- constraint graph
- global constraints
- set bounds propagation
- branch and bound algorithm
- linear programming
- variable ordering
- reinforcement learning
- integer programming
- satisfiability problem
- dynamic systems
- combinatorial optimization