Zero-coefficient cuts

DOI10.1007/978-3-642-13036-6_5MaRDI QIDQ3569808zbMATH OpenOpenAlexFDO

Authors K. H. Andersen, Robert Weismantel

Publication date 22 June 2010

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13036-6_5

zbMATH Keywords

cutting planelattice basismixed integer programsplit cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
• Generalized coefficient strengthening cuts for mixed integer programming
• Gomory cuts revisited
• Cutting planes in integer and mixed integer programming
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

Cited in

(8)

• Split cuts from sparse disjunctions
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• Coordinated cutting plane generation via multi-objective separation
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
• A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
• Generalized coefficient strengthening cuts for mixed integer programming
• Coefficient strengthening: a tool for reformulating mixed-integer programs
• Approximating polyhedra with sparse inequalities

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: Zero-coefficient cuts

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