Automating Cutting Planes is NP-Hard}.
Mika GöösSajin KorothIan MertzToniann PitassiPublished in: CoRR (2020)
Keyphrases
- cutting plane
- np hard
- integer programming
- lower bound
- knapsack problem
- cutting plane algorithm
- column generation
- integer programming problems
- linear programming
- approximation algorithms
- np complete
- linear program
- valid inequalities
- optimal solution
- multistage stochastic
- special case
- branch and bound algorithm
- worst case
- upper bound
- integer program
- scheduling problem
- lagrangian relaxation
- mixed integer
- dantzig wolfe decomposition
- constraint satisfaction problems
- computational complexity
- minimum cost
- branch and bound
- linear programming relaxation
- vehicle routing problem
- network flow