The following pages link to (Q4537754):
Displaying 17 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← 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)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints (Q2815438) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
