Extensions of a theorem of Balas

DOI10.1016/0166-218X(84)90087-8MaRDI QIDQ1075945zbMATH OpenOpenAlexFDO

Authors C. E. Blair, Robert G. Jeroslow

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90087-8

zbMATH Keywords

'countable convergencecutting- plane algorithmsfacial constraintsfinite convergence

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4083363
• Balas formulation for the union of polytopes is optimal
• Facet inequalities from simple disjunctions in cutting plane theory
• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• scientific article; zbMATH DE number 4039634

Cites work

• A Cutting-Plane Game for Facial Disjunctive Programs
• Cutting-Planes for Complementarity Constraints
• Disjunctive Programming
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Two Rules for Deducing Valid Inequalities for 0-1 Problems

Cited in

(3)

• Sequential convexification in reverse convex and disjunctive programming
• On extensions of a theorem of Baxter
• On extensions of the Baer-Suzuki theorem

This page was built for publication: Extensions of a theorem of Balas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075945)