Random CNFs are Hard for Cutting Planes.
Noah FlemingDenis PankratovToniann PitassiRobert RoberePublished in: CoRR (2017)
Keyphrases
- cutting plane
- integer programming problems
- lower bound
- cutting plane algorithm
- integer programming
- random instances
- integer program
- column generation
- mixed integer
- knapsack problem
- valid inequalities
- artificial bee colony algorithm
- recursive least squares
- upper bound
- reinforcement learning
- feasible solution
- branch and bound
- dantzig wolfe decomposition