Zero-Coefficient Cuts

DOI10.1007/978-3-642-13036-6_5zbMath1285.90015OpenAlexW1516941466MaRDI QIDQ3569808

Robert Weismantel, Kent Andersen

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 planesplit cutmixed integer programlattice basis

Mathematics Subject Classification ID

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

Related Items (4)

Approximating polyhedra with sparse inequalities ⋮ Split cuts from sparse disjunctions ⋮ A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs

Uses Software

• MIPLIB

This page was built for publication: Zero-Coefficient Cuts