Abstract
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0–1 variables. We also explore the use of Gomory's mixed-integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framework. We compare results obtained by using our cut generation routines in two existing systems with a commercially available branch-and-bound code on a range of test problems arising from practical applications. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, S. Ceria, G. Cornuéjols, Mixed 0–1 programming by lift-and-project in a branch-and-cut framework, Management Science 42 (1996) 1229–1246.
H. Crowder, E.L. Johnson, M.W. Padberg, Solving large-scale zero–one linear programming problems, Operations Research 31 (1983) 803–834.
T.J. Van Roy, L.A. Wolsey, Solving mixed 0–1 programs by automatic reformulation, Operations Research 35 (1987) 145–163.
T.L. Magnanti, P. Mirchandani, Shortest paths, network design and associated polyhedra, Networks 23 (1993) 103–121.
Y. Pochet, L.A. Wolsey, Integer knapsacks and flow covers with divisible coefficients: polyhedra, optimization and separation, Discrete Applied Mathematics 59 (1995) 57–74.
H. Marchand, Etude d'un problème d'optimisation lié à la gestion d'un parc électrique, Mémoire d'ingénieur civil en mathématiques appliquées, UCL, Louvain-la-Neuve, 1994.
G.L. Nemhauser, L.A. Wolsey, A recursive procedure for generating all cuts for 0–1 mixed integer programs, Mathematical Programming 46 (1990) 379–390.
M.W. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming 5 (1973) 199–215.
L.A. Wolsey, Facets and strong valid inequalities for integer programs, Operations Research 24 (1976) 367–372.
R.E. Gomory, Solving linear programming problems in integers, in: R.E. Bellman, M. Hall, Jr. (Eds.), Combinatorial Analysis, American Mathematical Society, Providence, RI, 1960, pp. 211–216.
E. Balas, S. Ceria, G. Cornuéjols, N.R. Natraj, Gomory cuts revisited, OR Letters 19 (1996) 1–9.
H.P. Williams, Model Building in Mathematical Programming, 3rd ed., Wiley, Chichester, 1993.
Pamips, Esprit Project 8755, Public Report Ref. DR4.3.5/I, 31/1/95.
W.A. Cook, Integer programming solutions for capacity expansion of the local access network, Bell Communications Research, Morristown, NJ, 1990.
B. Brockmueller, O. Gunluk, L.A. Wolsey, Designing Private Line Networks: Polyhedral Analysis and Computation. CORE Discussion paper DP9647, Université Catholique de Louvain (1996).
R.E. Bixby, S. Ceria, C. McZeal, M. Savelsbergh, An Updated Mixed Integer Programming Library: MIPLIB 3.0 (in preparation).
CPLEX 3.0 Optimizer, CPLEX Inc.
XPRESS-MP optimisation subroutine library, Reference Manual, Release 9, Dash Associates, Blisworth House, Blisworth, Northants NN7 3BX, UK.
R. Weismantel, On the 0–1 knapsack polytope, Mathematical Programming 77 (1997) 49–68.
Author information
Authors and Affiliations
Additional information
Corresponding author.
This research was partly performed when the author was affiliated with CORE, Université Catholique de Louvain.
Rights and permissions
About this article
Cite this article
Ceria, S., Cordier, C., Marchand, H. et al. Cutting planes for integer programs with general integer variables. Mathematical Programming 81, 201–214 (1998). https://doi.org/10.1007/BF01581105
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581105