Login / Signup
Random CNFs are Hard for Cutting Planes.
Noah Fleming
Denis Pankratov
Toniann Pitassi
Robert Robere
Published in:
Electron. Colloquium Comput. Complex. (2017)
Keyphrases
</>
cutting plane
cutting plane algorithm
integer programming
lower bound
column generation
integer programming problems
mixed integer
knapsack problem
dantzig wolfe decomposition
integer program
random instances
valid inequalities
linear programming
recursive least squares