On a generalization of the master cyclic group polyhedron

DOI10.1007/s10107-008-0252-7zbMath1214.90125OpenAlexW2071841313MaRDI QIDQ1960187

Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük

Publication date: 13 October 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-008-0252-7

zbMATH Keywords

liftingseparation algorithmmaster equality polyhedronfacet-defining inequalities for MIP

Mathematics Subject Classification ID

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

Related Items (5)

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ The master equality polyhedron with multiple rows ⋮ Strengthening lattice-free cuts using non-negativity ⋮ Vectors in a box ⋮ Constructing general dual-feasible functions

Uses Software

• PORTA

Cites Work

• Unnamed Item
• Mixed-integer cuts from cyclic groups
• On the strength of Gomory mixed-integer cuts as group cuts
• How tight is the corner relaxation?
• Corner polyhedra and their connection with cutting planes
• T-space and cutting planes
• Cyclic group and knapsack facets
• Sequence independent lifting in mixed integer programming
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Valid inequalities based on the interpolation procedure
• Some polyhedra related to combinatorial problems
• Valid inequalities based on simple mixed-integer sets
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Facets of the Knapsack Polytope From Minimal Covers
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II

This page was built for publication: On a generalization of the master cyclic group polyhedron