Skip to main content
SpringerLink
Log in

Branch and Cut Methods for Mixed Integer Linear Programming Problems

  • Chapter
Book cover Progress in Optimization

Part of the book series: Applied Optimization ((APOP,volume 39))

Abstract

The discrete optimization problems arising in industry are typically very large and computationally difficult to solve. Over the past decade, the method of Branch and Cut has emerged as a powerful technique for solving large mixed integer linear programming problems. Advances in computer technology together with advances in computational algorithms now makes it possible to obtain provably good solutions for many industrial optimization problems. This paper focuses on the application of Branch and Cut. An example from the mining industry demonstrates the value of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aardal, K, and Van Hoesel, S., (1996), Polyhedral techniques in combinatorial optimization I: Theory, Statistica Neerlandica, Vol. 50, pp. 4–26.

    Article  Google Scholar 

  • Aardal, K, and Van Hoesel, S., Polyhedral techniques in combinatorial optimization II: Computations, Statistica Neerlandica (to appear).

    Google Scholar 

  • Aarts, E. and Lenstra J.K., (Eds.), (1997), Local search in combinatorial optimization, J Wiley and Sons, Chichester.

    MATH  Google Scholar 

  • Achuthan, N.R., Caccetta, L. and Hill, S.P., (1995), A new subtour elimination constraint for the vehicle routing problem, European Journal of Operations Research, Vol. 91, pp. 573–586.

    Article  Google Scholar 

  • Achuthan, N.R., Caccetta, L. and Hill, S.P., (1999a), An improved branch and cut algorithm for the capacitated vehicle routing problem, (submitted for publication).

    Google Scholar 

  • Achuthan, N.R., Caccetta, L. and Hill, S.P., (1998), The capacitated vehicle routing problem: Some new cutting planes, Asia Pacific Journal of Operational Research, Vol. 15, pp. 109–123.

    MathSciNet  MATH  Google Scholar 

  • Achuthan, N.R., Caccetta, L. and Hill, S.P., (1999b), The vehicle routing problem with capacity and distance restrictions (submitted for publication).

    Google Scholar 

  • Applegate, D., Bixby, R., Chvatal, V. and Cook, W. (1995), Finding cuts in the TSP (A preliminary report). DIMACS Technical Report

    Google Scholar 

  • Applegate, D., Bixby, R., Chvatal, V. and Cook, W. (1998), On the solution of traveling salesman problems, Documenta Mathematica (Journal der Deutschen Mathematiker-Vereinigung), International Congress of Mathematicians, pp. 645–656.

    Google Scholar 

  • Araque, J.R., Kudva, G, Morin, T.L., and Pekny, J.F., (1994), A branch-andcut algorithm for vehicle routing problems, Annals of Operations Research, Vol. 50, pp. 37–59.

    Article  MathSciNet  MATH  Google Scholar 

  • Augerat, P., Belengeur, J.M., Benavent, E., Corberan, A., Naddef N., and Rinaldi, G., (1995), Computational results with a branch and cut code for the capacitated vehicle routing problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France.

    Google Scholar 

  • Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsberg, M.W.P., and Vance, P.H., (1998), Branch and Price: Column generation for solving huge integer programs, Oper. Res., Vol. 46, pp. 316–329.

    Article  MathSciNet  MATH  Google Scholar 

  • Balas, E. and Toth, P. (1985), Branch and bound methods, in The Traveling Salesman Problem (Lawler, E.L., Lenstra, J.K., Rinnoy Kan A.G.H. and Shmoys, D.B., Editors) John Wiley and Sons, pp. 361–401.

    Google Scholar 

  • Balas, E., Celia, S. and Cornuéjols, G., (1993), A lift-and-project cutting plane algorithm for mixed 0–1 programs, Mathematical Programming, Vol. 58, pp. 295–324.

    Article  MathSciNet  MATH  Google Scholar 

  • Balas, E., Celia, S. and Cornuéjols, G., (1996), Mixed 0–1 programming by lift-and-project in a branch-and-cut framework, Management Science, Vol. 42, pp. 1229–1246.

    Article  MATH  Google Scholar 

  • Ball, M.O. Magnanti, T.L., Monma, C.L., and Nemhauser, G. (Eds)., (1995), Network routing, Vol 8 of Handbooks in Operations Research and Management Science, North Holland, Amsterdam.

    Google Scholar 

  • Bertsekas, D.P., (1991), Linear network optimization: algorithms and codes, MIT Press, Cambridge, MA.

    MATH  Google Scholar 

  • Boyd, E. D., (1996) On the complexity of a cutting plane algorithm for solving combinatorial linear programs, SIAM Journal on Discrete Mathematics, pp. 365–376.

    Google Scholar 

  • Boyd, S.T. and Cunningham, W., (1991), Small traveling salesman polytopes, Math. Ops. Res., Vol. 16, pp. 259–271.

    Article  MathSciNet  MATH  Google Scholar 

  • Caccetta, L. and Giannini, L.M., (1986), Optimization techniques for the open pit limit problem, Proc. Australas. Inst. Min. Metall., Vol. 29, pp. 57–63.

    Google Scholar 

  • Caccetta, L. and Giannini, L.M., (1990), Application of operations research techniques in open pit mining, in Asian-Pacific Operations Research: APORS’88 (Byong-Hun Ahn Ed.), Elseview Science Publishers BV, pp. 707–724.

    Google Scholar 

  • Caccetta, L. and Giannini, L.M.,and Kelsey, P., (1994), On the implementation of exact optimization techniques for open pit design, Asia-Pacific Journal of Operations Research, Vol. 11, pp. 155–170.

    MATH  Google Scholar 

  • Caccetta, L. and Giannini, L.M., and Kelsey, P., (1994), On the implementation of exact optimization techniques for open pit design, Asia-Pacific Journal of Operations Research, Vol. 11, pp. 155–170.

    MATH  Google Scholar 

  • Caccetta, L. and Hill, S.P., (1999b) A branch and cut method for the degree constrained minimum spanning tree problem, Networks, (to appear).

    Google Scholar 

  • Caccetta, L. and Hill, S.P., (1999c) An application of branch and cut to open pit mine scheduling (submitted for publication).

    Google Scholar 

  • Caccetta, L., Kelsey, P. and Giannini, L.M., (1998), Open pit mine production scheduling, in Computing Applications in the Minerals Industries International Symposium (3rd Regional APCOM) (A. J. Basu, N. Stockton and D. Spottiswood, Eds.), Austral. Inst. Min. Metall. Publication Series, Vol. 5, pp. 65–72.

    Google Scholar 

  • Caprara, A. and Fischetti, M., (1997), Branch-and-cut algorithms, Annotated Bibliographies in Combinatorial Optimization, (M. Dell’Amico, F. Maffioli and S. Martello, Editors), J. Wiley and Sons, Chichester.

    Google Scholar 

  • Chvâtal, V., (1973), Edmonds polytopes and weakly hamiltonian graphs, Math. Programming, Vol. 5, pp. 29–40.

    Article  MathSciNet  MATH  Google Scholar 

  • Cook, W., Cunningham, W.H., Pulleybank, W.R. and Schrijver, A. (1998), Combinatorial Optimization, Wiley, New York.

    MATH  Google Scholar 

  • Cornuéjols, G., Fonlupt J., and Naddef, D., (1985), The Traveling salesman problem on a graph and some related integer polyhedra, Mathematical Programming, Vol. 33, pp. 1–27.

    Article  MathSciNet  MATH  Google Scholar 

  • Cornuéjols, G., and Harche, F., (1993), Polyhedral study of the capacitated cehicle routing problem, Mathematical Programming, Vol. 60, pp. 21–52.

    Article  MathSciNet  MATH  Google Scholar 

  • Crowder, H., Johnson, E.L. and Padberg, M. (1983), Solving large-scale zero one linear programming problems, Oper. Res., Vol. 33, pp. 803–834.

    Article  Google Scholar 

  • Crowder, H. and Padberg, M.W., (1980), Solving large-scale symmetric traveling salesman problems to optimality, Management Science, Vol. 26, pp. 495–509.

    Article  MathSciNet  MATH  Google Scholar 

  • Dantzig, G.B., Fulkerson, D.R and Johnson, S.M., (1954), Solution of a large scale traveling salesman problem, Operations Research, Vol. 2, pp. 393–410.

    Article  MathSciNet  Google Scholar 

  • Dantzig, G.B., Fulkerson, D.R and Johnson, S.M., (1959), On a linear-programming combinatorial approach to the traveling-salesman problem, Operations Research, Vol. 7, pp. 58–66.

    Article  MathSciNet  Google Scholar 

  • Dell’Amico, M., Maffioli, F. and Martello, S.,(Eds.), (1997), Annotated biobliographies in combinatorial optimization, John Wiley and Sons, Chichester.

    Google Scholar 

  • Desrochers, M., Desrosiers, J. and Solomon, M. (1992), A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, Vol. 40, pp. 342–354.

    Article  MathSciNet  MATH  Google Scholar 

  • Du, D.Z. and Pardalos, P.M.,(Eds.), (1998), Handbook on combinatorial optimization (3 volumes), Kulwer Academic Publishers, Boston.

    Google Scholar 

  • Edmonds, J., (1965), Maximum matching and a polyhedron with 0.1 vertices, Journal of Research of the National Bureau of Standards, Vol. 69B, pp. 67–72.

    MathSciNet  Google Scholar 

  • Fisher, M. L., (1981), The Lagrangian relaxation method for solving integer programming problems, Management Science, Vol. 27, pp. 1–17.

    Article  MathSciNet  MATH  Google Scholar 

  • Fisher, M. L., (1994), Optimal solution of vehicle routing problems using minimum K-trees, Operations Research, Vol. 42, pp. 626–642.

    Article  MathSciNet  MATH  Google Scholar 

  • Fisher, M. L., Northup, W.D. and Shapiro, J.F., (1975), Using duality to solve discrete optimization problems: theory and computational experience, Math. Programming Study, Vol. 3, pp. 56–94.

    MathSciNet  Google Scholar 

  • Fleishmann, B., (1988), A new class of cutting planes for the symmetric traveling salesman problem, Mathematical Programming, Vol. 40, pp. 225–246.

    Article  MathSciNet  Google Scholar 

  • Garvin, W.M., Crandall, H.W. John, J.B. and Spellman, R.A., (1957), Applications of linear programming in the oil industry, Management Science, Vol. 3, pp. 407–430.

    MATH  Google Scholar 

  • Geoffrion, A.M., (1974), Lagrangean relaxation for integer programming, Math. Programming Study, Vol. 2, 82–114.

    MathSciNet  Google Scholar 

  • Golden, B.L. and. Assad, A.A., (Eds.), (1988), Vehicle routing: methods and studies, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • Graham, R., Grötschel, M. and Lovâsz, L (Eds.), (1995), Handbook of combinatorics, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • Grötschel, M. (1980), On the symmetric travelling salesman problem: solution of a 120-city problem, Mathematical Programming Studies, Vol. 12, pp. 61–77.

    MATH  Google Scholar 

  • Grötschel, M. and Holland, O. (1991), Solution of large-scale symmetric travelling salesman problems, Mathematical Programming, Vol. 51, pp. 141–202.

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M. and Holland, O. (1987), A cutting plane algorithm for minimum perfect two matching, Computing, Vol. 39, pp. 327–344.

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M., Lovâsz, L. and Schriver, A., (1988), Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • Grötschel, M. and Padberg, M.W. (1985), Polyhedral theory, in The travelling salesman problem (E.L. Lawler, J.K. Lenstra, A.G.H. Rinnooy Kan and D.B. Shmoys, Eds.), John Wiley and Sons, pp. 251–305.

    Google Scholar 

  • Grötschel, M. and Pulleybank, W.R. (1986), Clique tree inequalities and the symmetric travelling salesman problem, Mathematics of Operations Research, Vol. 11, pp. 537–569.

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., and Karp, R.M. (1970), The travelling salesman problem and minimum spanning trees, Oper. Res., Vol. 18, pp. 1138–1162.

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M and Karp, R.M., (1971), The travelling salesman problem and minimum spanning trees: part II, Math. Programming, Vol. 1, pp. 6–25.

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., Wolfe, P. and Crowder, H.D., (1974), Validation of subgradient optimization, Math. Programming, Vol. 6, pp. 62–88.

    Article  MathSciNet  MATH  Google Scholar 

  • Hoffman, K. and Padberg, M., (1991), Improving LP-representations of zero-one linear programs for branch and cut, ORSA Journal on Computing, Vol. 3, pp. 121–134.

    MATH  Google Scholar 

  • Hoffman, K. and Padberg, M., (1993), Solving airline crew scheduling problems by branch-and-cut, Management Science39, pp. 657–682.

    Article  MATH  Google Scholar 

  • Ibaraki, T., (1987), Enumerative approaches to combinatorial optimization - Part I., Annals of Operations Research 10, Baltzer Basel.

    Google Scholar 

  • Ibaraki, T., Enumerative approaches to combinatorial optimization - Part II., Annals of Operations Research 11, Baltzer, Basel.

    Google Scholar 

  • Johnson, E.L., (1980), Integer programming, SIAM CBMS-NSF Series No. 32.

    MATH  Google Scholar 

  • Laporte, G., (1992a), The travelling salesman problem: an overview of exact and approximate algorithms, European Journal of Operational Research, Vol. 59, pp. 231–247.

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte, G., (1992b), The vehicle routing problem: an overview of exact and approximate algorithms, European Journal of Operations Research, Vol. 59, pp. 345–358.

    Article  MATH  Google Scholar 

  • Laporte, G. and Bourjolly, J.M., (1984), Some further results on k-star constraints and comb inequalities, Cahiers Du GERAD, G-82–10, Ecole des Hautes Etudes Commerciales de Montral.

    Google Scholar 

  • Laporte, G., Mercure, H., and Nobert, Y., (1986), An exact algorithm for the asymmetrical capacitated vehicle routing problem, Networks, Vol. 16, pp. 33–46.

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte, G., Mercure, H., and Nobert, Y., (1992), A branch and bound algorithm for a class of asymmetrical vehicle routing problems, Journal of the Operational Research Society, Vol. 43, pp. 469–481.

    MATH  Google Scholar 

  • Laporte, G., Desrochers M., and Nobert, Y., (1984), Two exact algorithms for the distance constrained vehicle routing problem, Networks, Vol. 14, pp. 161–172.

    Article  MATH  Google Scholar 

  • Laporte, G. and Nobert, Y., (1984), Comb inequalities for the vehicle routing problem, Methods of Operational Research, Vol. 51, pp. 271–276.

    MathSciNet  MATH  Google Scholar 

  • Laporte, G. and Nobert, Y., (1980), A cutting plane algorithm for the msalesman problem, Journal of the Operational Research Society, Vol. 31, pp. 1017–1023.

    MathSciNet  MATH  Google Scholar 

  • Laporte, G., Nobert, Y. and Desrochers, M., (1985), Optimal routing under capacity and distance restrictions, Oper. Res., Vol. 33, pp. 1050–1073.

    Article  MathSciNet  MATH  Google Scholar 

  • Lawler, E.L., (1976), Combinatorial optimization: networks and matroids, Holt Rinehart and Winston, New York.

    MATH  Google Scholar 

  • Lawler, E.L., Lenstra, J.K., Rinnooy Kan A.H.G., and Shmoys, D.B., (1985), The travelling salesman problem, John Wiley & Sons.

    Google Scholar 

  • Lerchs, H., and Grossmann, L.F., (1965), Optimum design of open pit mines, Canad. Inst. Mining Bull., Vol. 58, pp. 47–54.

    Google Scholar 

  • Lovâsz, L. and Plummer, M., (1986), Matching theory, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • Martello, S., Laporte, G., Minoux M. and Ribeiro C.,(Eds.), (1987), Surveys in combinatorial optimization, North-Holland, Amsterdam.

    MATH  Google Scholar 

  • Martello, S. and Toth, P. (1990), Knapsack problems: algorithms and computer implementations, Wiley, New York.

    MATH  Google Scholar 

  • Moré J.J. and Wright, S.J. (1993), Optimization software guide, SIAM Frontiers in Applied Mathematics 14.

    MATH  Google Scholar 

  • Nemhauser G.L., Rinnooy Kan A.G.H. and Todd M.J. (Eds.), (1988), Optimization Vol 1 of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam.

    Google Scholar 

  • Nemhauser G.L. and Wolsey, L.A. (1988), Integer and combinatorial optimization, John Wiley and Sons.

    MATH  Google Scholar 

  • Padberg M. and Hong, S. (1980), On the symmetric travelling salesman problem: a computational study, Mathematical Programming Studies, Vol. 12, pp. 78–107.

    MathSciNet  MATH  Google Scholar 

  • Padberg M.W. and Rao, M.R. (1982), Odd minimum cut sets and b-matchings, mathematics of operations research, Vol. 7, pp. 67–80.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg M. and Rinaldi, G. (1987), Optimization of a 532-symmetric travelling salesman problem, Operations Research Letters, Vol. 6, pp. 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg M. and Rinaldi, G. (1990a), An efficient algorithm for the minimum capacity cut problem, Mathematical Programming, Vol. 47, pp. 19–36.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg M. and Rinaldi, G. (1991), A branch and cut algorithm for the resolution of large scale travelling salesman problems, SIAM Review, Vol. 33 No. 1, pp. 60–100.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg M. and Rinaldi, G. (1990b), Facet identification for the symmetric travelling salesman polytope, Mathematical Programming, Vol. 47, pp. 219–257.

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou C.H. and Steiglitz, K. (1982), Combinatorial optimization: algorithms and complexity, Prentice-Hall Inc., Englewood Cliffs, NJ.

    MATH  Google Scholar 

  • Picard, J.C. (1976), Maximum closure of a graph and applications to combinatorial problems, Management Sc., Vol. 22, pp. 1268–1272.

    Article  MathSciNet  MATH  Google Scholar 

  • Reinelt, G. (1991), A travelling salesman problem library, ORSA Journal of Computing, Vol. 3, pp. 376–384.

    MATH  Google Scholar 

  • Savelsbergh, M.W.P. (1994), Preprocessing and probing techniques for mixed integer programming problems, ORSA J. on Computing, Vol. 6, pp. 445–454.

    MathSciNet  MATH  Google Scholar 

  • Schrijver, A. (1986), Theory of Linear and Integer Programming, Wiley, New York.

    MATH  Google Scholar 

  • Shapiro, J.F., (1979), A survey of lagrangean techniques for discrete optimization, Annals of Discrete Math, Vol. 5, pp. 113–138.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Curtin University of Technology, GPO Box U 1987, Perth, WA, 6845, Australia

    Louis Caccetta

Authors
  1. Louis Caccetta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Xiaoqi Yang Ph. D. (Assistant Professor) (Assistant Professor)

  2. The University of Western Australia, Perth, Australia

    Les Jennings

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Kluwer Academic Publishers

About this chapter

Cite this chapter

Caccetta, L. (2000). Branch and Cut Methods for Mixed Integer Linear Programming Problems. In: Yang, X., Mees, A.I., Fisher, M., Jennings, L. (eds) Progress in Optimization. Applied Optimization, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0301-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0301-5_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7986-7

  • Online ISBN: 978-1-4613-0301-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation