A polyhedral study of the mixed integer cut

DOI10.1007/978-3-642-13036-6_10MaRDI QIDQ3569813zbMATH OpenOpenAlexFDO

Authors Steve Tyber, Ellis L. Johnson

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_10

zbMATH Keywords

integer programmingcutting planesgroup relaxationmaster cyclic group polyhedronmaster knapsack polytope

Mathematics Subject Classification ID

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

Recommendations

• On the strength of Gomory mixed-integer cuts as group cuts
• Mixed-Integer Cuts from Cyclic Groups
• Mixed-integer cuts from cyclic groups
• Mixed integer rounding cuts and master group polyhedra
• Classical cuts for mixed-integer programming and branch-and-cut

Cited in

(9)

• \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
• Knapsack polytopes: a survey
• On the strength of Gomory mixed-integer cuts as group cuts
• Optimal cutting planes from the group relaxations
• A concise characterization of strong knapsack facets
• The group-theoretic approach in mixed integer programming
• A geometric approach to cut-generating functions
• Mixed integer rounding cuts and master group polyhedra
• Mixed-Integer Cuts from Cyclic Groups

This page was built for publication: A polyhedral study of the mixed integer cut

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