Abstract
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This is not surprising as lifting techniques make explicit use of the bounds on variables, whereas the MIR procedure does not. In this paper we describe a simple procedure, which we call mingling, for incorporating variable bound information into MIR. By explicitly using the variable bounds, the mingling procedure leads to strong inequalities for mixed-integer sets with bounded variables. We show that facets of mixed-integer knapsack sets derived earlier by superadditive lifting techniques can be obtained by the mingling procedure. In particular, the mingling inequalities developed in this paper subsume the continuous cover and reverse continuous cover inequalities of Marchand and Wolsey (Math Program 85:15–33, 1999) as well as the continuous integer knapsack cover and pack inequalities of Atamtürk (Math Program 98:145–175, 2003; Ann Oper Res 139:21–38, 2005). In addition, mingling inequalities give a generalization of the two-step MIR inequalities of Dash and Günlük (Math Program 105:29–53, 2006) under some conditions.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Atamtürk A.: On the facets of mixed-integer knapsack polyhedron. Math. Program. 98, 145–175 (2003)
Atamtürk A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487–490 (2004)
Atamtürk A.: Cover and pack inequalities for (mixed) integer programming. Ann. Oper. Res. 139, 21–38 (2005)
Balas E.: Disjunctive programming. Ann. Discret. Math. 5, 3–51 (1979)
Chvátal V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4, 305–337 (1973)
Cook W., Kannan R., Schrijver A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)
Dash S., Günlük O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105, 29–53 (2006)
Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960)
Marchand H., Wolsey L.A.: The 0-1 knapsack problem with a single continuous variable. Math. Program. 85, 15–33 (1999)
Marchand H., Wolsey L.A.: 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)
Nemhauser G.L., Wolsey L.A.: A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Program. 46, 379–390 (1990)
Acknowledgments
We are grateful to two anonymous referees for their valuable suggestions.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is funded, in part, by an IBM faculty award. A. Atamtürk is grateful for the hospitality of the Georgia Institute of Technology, where part of this research was conducted.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Atamtürk, A., Günlük, O. Mingling: mixed-integer rounding with bounds. Math. Program. 123, 315–338 (2010). https://doi.org/10.1007/s10107-009-0265-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-009-0265-x