Abstract
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-scale integer programs to optimality. This is especially true for mixed 0-1 and pure 0-1 problems. However, other approaches to integer programming are possible. One alternative is provided by so-called augmentation algorithms, in which a feasible integer solution is iteratively improved (augmented) until no further improvement is possible.
Recently, Weismantel suggested that these two approaches could be combined in some way, to yield an augment-and-branch-and-cut (ABC) algorithm for integer programming. In this paper we describe a possible implementation of such a finite ABC algorithm for mixed 0-1 and pure 0-1 programs. The algorithm differs from standard branch-and-cut in several important ways. In particular, the terms separation, branching, and fathoming take on new meanings in the primal context.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Balas, S. Ceria & G. Cornuéjols (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295–324.
E. Balas, S. Ceria & G. Cornuéjols (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Mgt. Sci. 42, 1229–1246.
E. Balas, S. Ceria, G. Cornuéjols & N. Natraj (1996) Gomory cuts revisited. Oper. Res. Lett. 19, 1–9.
A. Ben-Israel & A. Charnes (1962) On some problems of diophantine programming. Cahiers du Centre d’Études de Recherche Opérationelle 4, 215–280.
A. Caprara & M. Fischetti (1997) Branch-and-Cut Algorithms. In M. Dell’Amico, F. Maffioli & S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 45–64. New York, Wiley.
H. Crowder, E.L. Johnson & M.W. Padberg (1983) Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803–834.
F. Eisenbrand, G. Rinaldi & P. Ventura (2001) 0/1 primal separation and 0/1 optimization are equivalent. Working paper, IASI, Rome.
R.T. Firla, U.-U. Haus, M. Köppe, B. Spille & R. Weismantel (2001) Integer pivoting revisited. Working paper, Institute of Mathematical Optimization, University of Magdeburg.
R.S. Garfinkel & G.L. Nemhauser (1972) Integer Programming. New York: Wiley.
F. Glover (1968) A new foundation for a simplified primal integer programming algorithm. Oper. Res. 16, 727–740.
R.E. Gomory (1958) Outline of an algorithm for integer solutions to linear programs. Bulletin of the AMS 64, 275–278.
R.E. Gomory (1960) An algorithm for the mixed-integer problem. Report RM-2597, Rand Corporation, 1960 (Never published).
M. Grötschel, L. Lovász & A.J. Schrijver (1988) Geometric Algorithms and Combinatorial Optimization. Wiley: New York.
U.-U. Haus, M. Köppe & R. Weismantel (2000) The integral basis method for integer programming. Math. Meth. of Oper. Res. 53, 353–361.
A.H. Land & A.G. Doig (1960) An automatic method for solving discrete programming problems. Econometrica 28, 497–520.
A.N. Letchford & A. Lodi (2001) Primal separation algorithms. Technical Report OR/01/5. DEIS, University of Bologna.
A.N. Letchford & A. Lodi (2002) Primal cutting plane algorithms revisited. Math. Methods of Oper. Res., to appear.
A.N. Letchford & A. Lodi (2002) Strengthening Chvátal-Gomory Cuts and Gomory fractional cuts. Oper. Res. Letters, to appear.
G.L. Nemhauser & L.A. Wolsey (1988) Integer and Combinatorial Optimization. New York: Wiley.
M.W. Padberg & M. Grötschel (1985) Polyhedral computations. In E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys (eds.). The Traveling Salesman Problem, John Wiley & Sons, Chichester, 307–360.
M.W. Padberg & S. Hong (1980) On the symmetric travelling salesman problem: a computational study. Math. Program. Study 12, 78–107.
M.W. Padberg & G. Rinaldi (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Rev. 33, 60–100.
A. Schulz, R. Weismantel & G. Ziegler (1995) 0-1 integer programming: optimization and augmentation are equivalent. In: Lecture Notes in Computer Science, vol. 979. Springer.
R. Thomas (1995) A geometric Buchberger algorithm for integer programming. Math. Oper. Res. 20, 864–884.
R. Urbaniak, R. Weismantel & G. Ziegler (1997) A variant of Buchberger’s algorithm for integer programming. SIAM J. on Discr. Math. 1, 96–108.
R. Weismantel (1999) Private communication.
R.D. Young (1965) A primal (all-integer) integer programming algorithm. J. of Res. of the National Bureau of Standards 69B, 213–250.
R.D. Young (1968) A simplified primal (all-integer) integer programming algorithm. Oper. Res. 16, 750–782.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Letchford, A.N., Lodi, A. (2003). An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-36478-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00580-3
Online ISBN: 978-3-540-36478-8
eBook Packages: Springer Book Archive