Generating cuts from multiple-term disjunctions
From MaRDI portal
Recommendations
- Reflections on generating (disjunctive) cuts
- On the separation of disjunctive cuts
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Generating cut conjunctions in graphs and related problems
- Cutting planes from two-term disjunctions
- Split cuts from sparse disjunctions
- On disjunctive cuts for combinatorial optimization
- Disjunctive logic programs, answer sets, and the cut rule
- scientific article; zbMATH DE number 1114456
- A logical approach to multicut problems
Cited in
(21)- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Partial hyperplane activation for generalized intersection cuts
- Lift-and-project for general two-term disjunctions
- Local cuts for mixed-integer programming
- Cutting planes from two-term disjunctions
- The strength of multi-row models
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
- When Lift-and-Project Cuts Are Different
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Reflections on generating (disjunctive) cuts
- Disjunctive cuts in mixed-integer conic optimization
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- \(\mathcal{V}\)-polyhedral disjunctive cuts
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Projection, lifting and extended formulation integer and combinatorial optimization
- Reformulating the disjunctive cut generating linear program
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
This page was built for publication: Generating cuts from multiple-term disjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537754)
