Approximability of Integer Programming with Generalised Constraints.
Peter JonssonFredrik KuivinenGustav NordhPublished in: CP (2006)
Keyphrases
- integer programming
- constraint programming
- integer program
- valid inequalities
- global constraints
- production planning
- round robin tournament
- np hard
- integer programming formulations
- network flow
- lagrangian relaxation
- linear programming
- column generation
- cutting plane algorithm
- ai planning
- cutting plane
- facility location
- constraint satisfaction
- crew scheduling
- lp relaxation
- set covering
- approximation algorithms
- vehicle routing problem with time windows
- inference problems
- set covering problem
- linear constraints
- transportation problem
- lot sizing
- mixed integer