Pages that link to "Item:Q507316"
From MaRDI portal
The following pages link to Cutting planes from extended LP formulations (Q507316):
Displayed 10 items.
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Fixed-charge transportation problems on trees (Q1728231) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)