Mixed integer rounding cuts and master group polyhedra

MaRDI QIDQ2928706zbMATH OpenFDO

Authors Sanjeeb Dash

Publication date 10 November 2014

zbMATH Keywords

cutting planesgroup polyhedrainteger programmingproof complexitysubadditive inequalities

Mathematics Subject Classification ID

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

Recommendations

• Valid inequalities based on simple mixed-integer sets
• Two-step MIR inequalities for mixed integer programs
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• A polyhedral study of the mixed integer cut
• On the strength of Gomory mixed-integer cuts as group cuts

Cited in

(9)

• Theoretical challenges towards cutting-plane selection
• Cutting sequences, regular polygons, and the Veech group
• Valid inequalities based on simple mixed-integer sets
• On mixing inequalities: rank, closure, and cutting-plane proofs
• A polyhedral study of the mixed integer cut
• Mixed-integer cuts from cyclic groups
• A note on the MIR closure
• Mingling: mixed-integer rounding with bounds
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: Mixed integer rounding cuts and master group polyhedra

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