The master equality polyhedron with multiple rows

DOI10.1007/s10107-010-0384-4zbMath1243.90145MaRDI QIDQ2429471

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

Publication date: 27 April 2012

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

Full work available at URL: https://doi.org/10.1007/s10107-010-0384-4

zbMATH Keywords

polaroid; subadditivity; separation problem; master equality polyhedron

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

A colorful Steinitz lemma with application to block-structured integer programs, Vectors in a box

Cites Work

• On the extreme inequalities of infinite group problems
• Valid inequalities for mips and group polyhedra from approximate liftings
• The ellipsoid method and its consequences in combinatorial optimization
• T-space and cutting planes
• Cyclic group and knapsack facets
• On a generalization of the master cyclic group polyhedron
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• On the facets of mixed integer programs with two integer variables and two constraints
• Some polyhedra related to combinatorial problems
• Valid inequalities based on simple mixed-integer sets
• Minimal Valid Inequalities for Integer Constraints
• On the complexity of integer programming
• Facets of Two-Dimensional Infinite Group Problems
• Inequalities from Two Rows of a Simplex Tableau
• Sequential-Merge Facets for Two-Dimensional Group Problems
• Some continuous functions related to corner polyhedra