Classical cuts for mixed-integer programming and branch-and-cut

DOI10.1007/S001860100120MaRDI QIDQ5906949zbMATH OpenOpenAlexFDO

Authors Manfred Padberg

Publication date 15 July 2003

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860100120

zbMATH Keywords

branch-and-cutcutting planesGomory cutsMixed-integer programming

Mathematics Subject Classification ID

History of operations research and mathematical programming (90-03) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Classical cuts for mixed-integer programming and branch-and-cut
• Gomory cuts revisited
• Cutting planes in integer and mixed integer programming
• Valid inequalities for mixed integer linear programs
• Polyhedral approaches to mixed integer linear programming

Cited in

(24)

• On degenerate multi-row Gomory cuts
• Foundation-penalty cuts for mixed-integer programs.
• Theoretical challenges towards cutting-plane selection
• An optimality cut for mixed integer linear programs
• The rank of (mixed-) integer polyhedra
• \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• An abstract model for branch-and-cut
• Sequential pairing of mixed integer inequalities
• Gomory cuts revisited
• Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment
• Spherical cuts for integer programming problems
• Polyhedral approaches to mixed integer linear programming
• A polyhedral study of the mixed integer cut
• Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
• On t-branch split cuts for mixed-integer programs
• scientific article; zbMATH DE number 1094766 (Why is no real title available?)
• scientific article; zbMATH DE number 1114456 (Why is no real title available?)
• scientific article; zbMATH DE number 2084777 (Why is no real title available?)
• Classical cuts for mixed-integer programming and branch-and-cut
• Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
• On interval-subgradient and no-good cuts
• Cutting planes in integer and mixed integer programming
• Valid inequalities for mixed integer linear programs

This page was built for publication: Classical cuts for mixed-integer programming and branch-and-cut

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