Automating Cutting Planes is NP-Hard.
Mika GöösSajin KorothIan MertzToniann PitassiPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- cutting plane
- np hard
- integer programming
- lower bound
- knapsack problem
- cutting plane algorithm
- optimal solution
- column generation
- integer programming problems
- linear programming
- np complete
- mixed integer
- special case
- integer program
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- multistage stochastic
- linear program
- minimum cost
- valid inequalities
- worst case
- lagrangian relaxation
- upper bound
- objective function
- dantzig wolfe decomposition
- lower and upper bounds
- computational complexity
- constraint satisfaction problems
- search tree
- branch and bound
- linear programming relaxation
- particle swarm optimization