Pages that link to "Item:Q969513"
From MaRDI portal
The following pages link to On the complexity of cutting-plane proofs using split cuts (Q969513):
Displaying 7 items.
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
