Login / Signup
Random (log n)-CNF Are Hard for Cutting Planes (Again).
Dmitry Sokolov
Published in:
STOC (2024)
Keyphrases
</>
cutting plane
lower bound
random instances
cutting plane algorithm
integer programming
integer programming problems
column generation
integer program
knapsack problem
worst case
boolean functions
valid inequalities
dantzig wolfe decomposition
mixed integer
branch and bound algorithm
upper bound