Random (log n)-CNF are Hard for Cutting Planes (Again).
Dmitry SokolovPublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- cutting plane
- lower bound
- random instances
- cutting plane algorithm
- integer programming
- integer programming problems
- worst case
- mixed integer
- upper bound
- integer program
- branch and bound algorithm
- knapsack problem
- boolean functions
- column generation
- dantzig wolfe decomposition
- valid inequalities
- truth assignment
- objective function
- np hard
- optimal solution
- mixed integer programming
- lower and upper bounds
- branch and bound
- linear program
- state space
- conjunctive normal form
- feature space
- search algorithm