Abstract
This paper develops a new generalized-branching technique called “explicit-constraint branching” (ECB) to improve the performance of branch-and-bound algorithms for solving mixed-integer programs (MIPs). ECB adds structure to a MIP, in the form of auxiliary constraints and auxiliary integer variables, to allow branching on groups of (original) integer variables that would not otherwise be possible. Computational tests on three sets of real-world MIPs demonstrate that ECB often improves solution times over standard branch and bound, sometimes dramatically.
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
Amini, M. and Racer, M. (1994) “A rigorous computational comparison of alternative solution methods for the generalized assignment problem”, Management Science, vol. 40, pp. 868–890.
Appleget, J.A. (1997) “Knapsack cuts and explicit-constraint branching for solving integer programs”, Ph.D. dissertation, Naval Postgraduate School, Monterey, CA, June 1997.
Balas, E. (1975) “Facets of the knapsack polytope”, Mathematical Programming, vol. 8, pp. 146–164.
Balas, E. and Zemel, E. (1978) “Facets of the knapsack polytope from minimal covers”, SIAM Journal of Applied Mathematics, vol. 34, pp. 119–148.
Beale, E.M.L. and Tomlin, J.A. (1970) “Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables”, in Proceedings of the 5th International Operations Research Conference, J. R. Lawrence (ed.), Tavistock Publications Limited, London, pp. 447–454.
Beasley, J.E. “Generalised assignment problem”, OR-Library, The Management School at Imperial College of Science, Technology, and Medicine, London, United Kingdom, available from http://mscmga.ms.ic.ac.uk/, Internet, accessed 10 February 1997.
Beasley, J.E. and Chu, P.C. (1995) “A genetic algorithm for the generalised assignment problem”, working paper, The Management School, Imperial College, London SW7 2AZ, England.
Bixby, R.E., Ceria, S., McZeal, C.M., and Savelsbergh, M.W.P. MIPLIB 3.0, Computational and Applied Mathematics Department, Rice University, Houston, Texas, available from http://www.caam.rice.edu/∼bixby/miplib/miplib.html, Internet, accessed 10 February 1997.
Brooke, A., Kendrick, D., and Meeraus, A. (1992) Release 2.25, GAMS, A Users Guide, GAMS Development Corporation, Washington, DC.
Brown, G., personal communication, October 14, 1995.
Cattrysse, D., Salomon, M., and Van Wassenhove, L.N. (1994) “A set partitioning heuristic for the generalized assignment problem”, European Journal of Operational Research, vol. 72, pp. 167–174.
CPLEX Optimization, Inc., CPLEX Manual, Using the CPLEXIM Callable Library and CPLEXlM Mixed Integer Library, Incline Village, Nevada, 1993.
Escudero, L.F. (1987) “On extensions of the Beale-Tomlin special ordered sets and strategies for LP-based solving a general class of scheduling problems”, Martin Beale Memorial Symposium, London, July.
Escudero, L.F. (1988) “S3 sets, an extension of the Beale-Tomlin special ordered sets”, Mathematical Programming: Series B, vol. 42, pp. 113–123.
Foster, B.A. and Ryan, D.M. (1981) “An integer programming approach to scheduling”, in Computer Scheduling of Public Transport (A. Wren, ed.) North-Holland Publishing Company, pp. 269–280.
GAMS Development Corporation (1996) GAMS—The Solver Manuals, Washington, DC.
Hummeltenberg, W. (1984) “Implementations of special ordered sets in MP software”, European Journal of Operations Research, vol. 17, pp. 1–15.
Jörnsten, K.O. and Larsson, T. (1988) “A generalized branching technique”, Department of Mathematics Research Report, Linkoping Institute of Technology.
Jörnsten, K.O. and Värbrand, P. (1991) “A hybrid algorithm for the generalized assignment problem”, Optimization, vol. 22, pp. 273–282.
Osman, I.H. (1995) “Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches”, OR Spektrum, vol. 17, pp. 211–225.
Ross, G.T. and Soland, R.M. (1975) “A branch and bound algorithm for the generalized assignment problem”, Mathematical Programming, vol. 8, pp. 91–103.
Ronen, D., personal communication, March 20, 1997.
Sol, M. (1994) “Column generation techniques for pickup and delivery problems”, Ph.D. thesis, Technische Universiteit Eindhoven.
Tomlin, J.A. (1970) “Branch and Bound Methods for Integer and Non-Convex Programming”, in Integer and Nonlinear Programming, J. Abadie (ed.), North-Holland Publishing Company, Amsterdam.
Vössner, S., and Wood, R. K. (1999) “A Plant-Line Scheduling Algorithm Using a Genetic Algorithm and Integer Programming”, Working Paper, 15 March.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Appleget, J.A., Wood, R.K. (2000). Explicit-Constraint Branching for Solving Mixed-Integer Programs. In: Laguna, M., Velarde, J.L.G. (eds) Computing Tools for Modeling, Optimization and Simulation. Operations Research/Computer Science Interfaces Series, vol 12. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4567-5_14
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4567-5_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7062-8
Online ISBN: 978-1-4615-4567-5
eBook Packages: Springer Book Archive