On Integer Programming and the Branch-Width of the Constraint Matrix.
William H. CunninghamJim GeelenPublished in: IPCO (2007)
Keyphrases
- integer programming
- global constraints
- np hard
- constraint programming
- lagrangian relaxation
- column generation
- linear programming
- cutting plane
- cutting plane algorithm
- inference problems
- network flow
- facility location
- ai planning
- set covering problem
- production planning
- valid inequalities
- set covering
- integer programming formulations
- linear programming relaxation
- integer program
- linear constraints
- crew scheduling
- vehicle routing problem with time windows
- transportation problem
- heuristic search