Pages that link to "Item:Q1019294"
From MaRDI portal
The following pages link to Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294):
Displaying 18 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
