Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
From MaRDI portal
Recommendations
Cited in
(13)- Extensions of a theorem of Balas
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- An algorithm for disjunctive programs
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- Cutting planes from two-term disjunctions
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Facet inequalities from simple disjunctions in cutting plane theory
- scientific article; zbMATH DE number 1114456 (Why is no real title available?)
- scientific article; zbMATH DE number 1757966 (Why is no real title available?)
- Reflections on generating (disjunctive) cuts
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- On disjunctive cuts for combinatorial optimization
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
This page was built for publication: Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703585)