Login / Signup
On the complexity of cutting-plane proofs using split cuts.
Sanjeeb Dash
Published in:
Oper. Res. Lett. (2010)
Keyphrases
</>
cutting plane
mixed integer linear programming
integer programming
cutting plane algorithm
integer program
lower bound
linear programming
computational complexity
evolutionary algorithm
dynamic systems
structural svms