On the Complexity of Selecting Disjunctions in Integer Programming.
Ashutosh MahajanTed K. RalphsPublished in: SIAM J. Optim. (2010)
Keyphrases
- integer programming
- np hard
- cutting plane
- linear programming
- set covering problem
- production planning
- cutting plane algorithm
- constraint programming
- decision problems
- lagrangian relaxation
- network flow
- facility location
- worst case
- inference problems
- computational complexity
- valid inequalities
- column generation
- ai planning
- layout design
- linear programming relaxation
- transportation problem
- vehicle routing problem with time windows
- set covering
- genetic algorithm
- set partitioning