Pages that link to "Item:Q2367913"
From MaRDI portal
The following pages link to A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913):
Displayed 23 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Branching on general disjunctions (Q543420) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)