Pages that link to "Item:Q1751106"
From MaRDI portal
The following pages link to On the relative strength of different generalizations of split cuts (Q1751106):
Displaying 8 items.
- Cut generation through binarization (Q896284) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
