Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes.
Noah FlemingDenis PankratovToniann PitassiRobert RoberePublished in: J. ACM (2022)
Keyphrases
- cutting plane
- lower bound
- worst case
- random instances
- cutting plane algorithm
- integer programming problems
- integer programming
- upper bound
- valid inequalities
- knapsack problem
- column generation
- integer program
- mixed integer
- dantzig wolfe decomposition
- branch and bound algorithm
- optimal solution
- branch and bound
- linear programming
- probabilistic model
- cost function
- search algorithm
- objective function