Abstract
In this paper we use facets of the convex hull of mixed-integer sets with two and three variables to derive valid inequalities for integer sets defined by a single equation. These inequalities also define facets of the master cyclic group polyhedron of Gomory. In particular, our inequalities generalize the 2slope facets of Araoz, Gomory, Johnson and Evans (2003). In addition, they dominate the strong fractional cuts of Letchford and Lodi (2002).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aardal, K., Weismantel, R., Wolsey, L.A.: Non-standard approaches to integer programming. Discrete Applied Mathematics 123, 5–74 (2002)
Agra, A., Constantino, M.F.: Description of 2-integer continuous knapsack polyhedra, working paper (2003)
Araoz, J., Gomory, R.E., Johnson, E.L., Evans, L.: Cyclic group and knapsack facets. Mathematical Programming 96, 377–408 (2003)
Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58, 295–324 (1993)
Balas, E., Ceria, S., Cornuéjols, G., Natraj, G.: Gomory cuts revisited. Operations Research Letters 19, 1–9 (1996)
Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice – closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory, and Applications, pp. 19–49. Kluwer Academic Publishers, Dordrecht (2000)
Cornuejols, G., Li, Y., Vandenbussche, D.: K-Cuts:A variation of Gomory mixed integer cuts from theLP tableau,To appear in INFORMS Journal on Computing
Dash, S., Günlük, O.: Valid Inequalities Based on Simple Mixed-Interger Sets, IBM Research Report RC22922 (2003)
Dash, S., Günlük, O.: Comparing valid inequalities for cyclic group polyhedra, IBM Research Report RC22989 (2003)
Evans, L.: Cyclic groups and knapsack facets with applications to cutting planes, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia (2002)
Gomory, R.E.: Some polyhedra related to combinatorial problems. Journal of Linear Algebra and its Applications 2, 451–558 (1969)
Gomory, R.E., Johnson, E.: Some continuous functions related to corner polyhedra I. Mathematical Programming 3, 23–85 (1972)
Gomory, R.E., Johnson, E.: Some continuous functions related to corner polyhedra II. Mathematical Programming 3, 359–389 (1972)
Gomory, R.E., Johnson, E.: T-space and cutting planes. Mathematical Programming 96, 341–375 (2003)
Gomory, R.E., Johnson, E.L., Evans, L.: Corner Polyhedra and their connection with cutting planes. Mathematical Programming 96, 321–339 (2003)
Letchford, N., Lodi, A.: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Operations Research Letters 30(2), 74–82 (2002)
Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Programming 60, 233–250 (1993)
Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363–371 (2001)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dash, S., Günlük, O. (2004). Valid Inequalities Based on Simple Mixed-Integer Sets. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive