Login / Signup
On the complexity of cutting plane proofs using split cuts.
Sanjeeb Dash
Published in:
Electron. Colloquium Comput. Complex. (2008)
Keyphrases
</>
cutting plane
cutting plane algorithm
integer programming
mixed integer linear programming
column generation
computational complexity
lower bound
knapsack problem
integer program
genetic algorithm
space complexity