Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions

DOI10.1287/OPRE.33.4.928zbMATH Open0581.90058OpenAlexW2148504147MaRDI QIDQ3703585FDOQ3703585

Authors: Hanif D. Sherali, Suvrajeet Sen 

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.4.928

Recommendations

• On disjunctive cuts for combinatorial optimization
• Facet inequalities from simple disjunctions in cutting plane theory
• Cutting planes from two-term disjunctions
• On cutting-plane proofs in combinatorial optimization
• scientific article; zbMATH DE number 3856823

zbMATH Keywords

linear inequalitiesdisjunctive programmingvalid inequalitygenerating cutting planes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear inequalities of matrices (15A39)

Cited In (12)

• Extensions of a theorem of Balas
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• Title not available (Why is that?)
• Facet inequalities from simple disjunctions in cutting plane theory
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• On disjunctive cuts for combinatorial optimization
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
• Reflections on generating (disjunctive) cuts
• An algorithm for disjunctive programs
• Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
• Cutting planes from two-term disjunctions
• 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)