Pages that link to "Item:Q384805"
From MaRDI portal
The following pages link to Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805):
Displaying 9 items.
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Cut generation through binarization (Q896284) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)