On a Generalization of the Master Cyclic Group Polyhedron

Authors:
Sanjeeb Dash;Ricardo Fukasawa;Oktay Günlük
Affiliations:
Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598,;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332,;Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598,
Venue:
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Year:
2007

Citing 5
Cited 0

Valid inequalities based on simple mixed-integer sets

Mathematical Programming: Series A and B
Valid inequalities based on the interpolation procedure

Mathematical Programming: Series A and B
Mixed-Integer Cuts from Cyclic Groups

Mathematical Programming: Series A and B
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

Mathematical Programming: Series A and B
How tight is the corner relaxation?

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron.We present an explicit characterization of the nontrivial facet-defining inequalities for MEP. This result generalizes similar results for the Master Cyclic Group Polyhedron by Gomory [9] and for the Master Knapsack Polyhedron by Araoz [1]. Furthermore, this characterization also gives a polynomial time algorithm for separating an arbitrary point from the MEP.We describe how facet defining inequalities for the Master Cyclic Group Polyhedron can be lifted to obtain facet defining inequalities for the MEP, and also present facet defining inequalities for the MEP that cannot be obtained in such a way. Finally, we study the mixed-integer extension of the MEP and present an interpolation theorem that produces valid inequalities for general Mixed Integer Programming Problems using facets of the MEP.