Skip to main content
SpringerLink
Log in

Exact Solution of Two Location Problems via Branch-and-Bound

  • Chapter
  • First Online:
Foundations of Location Analysis

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 155))

  • 2850 Accesses

Abstract

In 1960, Land and Doig published a paper that most scholars recognize as the first description of a now well-known technique for solving difficult optimization problems by solving a sequence of easier, restricted subproblems (Land and Doig 1960). Little et al. (1963) named this technique “Branch-and-Bound” (B&B), and used it to solve the traveling salesman problem. Although the method is described and used in several papers in the 1960s (see for example, Lawler and Wood ), the description below, provided by Hillier and Lieberman (1980), succinctly captures the idea.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

References

  • Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33:42–54

    Google Scholar 

  • Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16. American Mathematical Society, Rhode Island, pp 43–75

    Google Scholar 

  • Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation--linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180:983–996

    Google Scholar 

  • Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math Program 97:27–42

    Google Scholar 

  • Anstreicher KM, Brixius NW (2001) A new bound for the quadratic assignment problem based on convex quadratic programming. Math Program 89:341–357

    Google Scholar 

  • Assad AA, Xu W (1985) On lower bounds for a class of quadratic 0,1 programs. Oper Res Lett 4:175–180

    Google Scholar 

  • Bazaraa MS, Jarvis JJ (1977) Linear programming and network flows. Wiley, New York

    Google Scholar 

  • Beltran-Royo C, Vial J-Ph, Alonso-Ayuso A (2007) Solving the uncapacitated facility location problem with semi-Lagrangian relaxation. Optimization On-line. http://www.optimization-online.org/DB_HTML/2007/02/1597.html. Accessed 22 Sept 2009

  • Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 3:79–97

    Google Scholar 

  • Burer S, Vandenbussche D (2006) Solving lift-and project relaxations of binary integer programs. SIAM J Optim 16:726–750

    Google Scholar 

  • Burkard RE, Cela E (1998) The quadratic assignment problem. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization, vol. 3. Kluwer, Dordrecht, pp 241–337

    Google Scholar 

  • Burkard RE, Cela E, Demindenko VM, Metelski NN, Woeginger GJ (1997) Perspectives of easy and hard cases of the quadratic assignment problem. SFB Report No. 104, Institute of Mathematics, Technical University Graz, Austria

    Google Scholar 

  • Christofides N, Gerrard M (1981) A graph theoretic analysis of bounds for the quadratic assignment problem. In: Hansen P (ed) Studies on graphs and discrete programming. North-Holland, New York, pp 61–68

    Google Scholar 

  • Cho DC, Johnson EL, Padberg M, Rao MR (1983a) On the uncapacitated plant location problem I: valid inequalities and facets. Math Oper Res 8:579–589

    Google Scholar 

  • Cho DC, Padberg M, Rao MR (1983b) On the uncapacitated plant location problem II: facets and lifting theorems. Math Oper Res 8:590–612

    Google Scholar 

  • Conway RW, Maxwell WL (1961) A note on the assignment of facility location. J Ind Eng 12:34–36

    Google Scholar 

  • Cornuejols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms. Manag Sci 23:789–810

    Google Scholar 

  • Cornuejols G, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New York

    Google Scholar 

  • Daskin M, Jones PC, Lowe TJ (1990) Rationalizing tool selection in a flexible manufacturing system for sheet metal products. Oper Res 38:1104–1115

    Google Scholar 

  • De Klerk E, Sotirov R (2008) Exploiting group symmetry in semidefinite relaxations of the quadratic assignment problem. Math Program, series A. Published online http://www.springerlink.com/content/85302n245v250051/fulltext.pdf. Accessed 22 Sept 2009

  • De Klerk E, Sotirov R (2009) Improved semidefinite bounds for quadratic assignment problems with suitable symmetry. Technical report. Available at http://stuwww.uvt.nl/~sotirovr/BB_QAP.pdf. Accessed 22 Sept 2009

  • Drezner Z (1995) Lower bounds based on linear programming for the quadratic assignment problem. Comput Optim Appl 4:159–165

    Google Scholar 

  • Efroymson MA, Ray TL (1966) A branch-bound algorithm for plant location. Oper Res 14:361–368

    Google Scholar 

  • Erlenkotter D (1978) A dual-based procedure for the uncapacitated facility location problem. Oper Research 26:992–1009

    Google Scholar 

  • Erogodan G (2006) Quadratic assignment problem: linearizations and polynomial time solvable cases. PhD Thesis, Department of Industrial Engineering, Bilkent University, Ankara, Turkey

    Google Scholar 

  • Ergodan G, Tansel B (2006) A Note on a polynomial time solvable case of the quadratic assignment problem. Discrete Optim 3:382–384

    Google Scholar 

  • Gavett JW, Plyter NV (1966) The optimal assignment of the facilities to locations by branch-and-bound. Oper Res 14:210–232

    Google Scholar 

  • Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10:305–313

    Google Scholar 

  • Goldengorin B, Ghosh D, Sierksma G (2003) Branch and peg algorithms for the simple plant location problem. Comp Oper Res 30:967–981

    Google Scholar 

  • Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17:727–739

    Google Scholar 

  • Hansen P, Brimberg J, Urosevic D, Mladenovic N (2007) Primal-dual variable neighborhood search for the simple plant location problem. INFORMS J Comp 19:552–564

    Google Scholar 

  • Hillier FS, Lieberman GJ (1980) Introduction to operations research, 3rd edn. Holder-Day, San Francisco

    Google Scholar 

  • Hoffman A, Kolen A, Sakarovich M (1985) Totally balanced and greedy matrices. SIAM J Algebraic Discrete Methods 6:721–730

    Google Scholar 

  • Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL (1995) Specially structured uncapacitated facility location problems. Oper Res 43:661–669

    Google Scholar 

  • Karisch SE, Cela E, Clausen J, Espersen T (1999) A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing 63:351–403

    Google Scholar 

  • Kolen A (1982) Location problems on trees and in the rectilinear plane. Stitchting Mathematisch Centrum, Amsterdam

    Google Scholar 

  • Kolen A, Tamir A (1990) Covering problems. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley, New York, pp 263–304 (Chap. 6)

    Google Scholar 

  • Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76

    Google Scholar 

  • Krarup J, Bilde O (1977) Plant location, set covering and economic lot size: an O(mn) algorithm for structured problems. In: Collatz L, Wetterling W (eds) Numerische Methoden bei Optimierungsaufgaben. Optimierung in graphentheoritischen und ganzzahligen Problemen, vol 3. International Series of Numerical Mathematics 36. Birkhaeuser, Basel, pp 155–180

    Google Scholar 

  • Land AH (1963) A problem of assignment with interrelated cost. Oper Res Quart 14:185–198

    Google Scholar 

  • Land AH, Doig AG (1960) An automatic method for solving discrete programming problems. Econometrica 27:497–540

    Google Scholar 

  • Lawler EL (1963) The quadratic assignment problem. Manag Sci 9:586–599

    Google Scholar 

  • Lawler EL, Wood DE (1966) Branch and bound methods: a survey. Oper Res 14:699–719

    Google Scholar 

  • Linderoth JT, Savelsbergh MWP (1999) A computational study of search strategies for mixed integer programming. INFORMS J Comput 11:173–187

    Google Scholar 

  • Little JDC, Murty KG, Sweeney DW, Harel C (1963) An algorithm for the traveling salesman problem. Oper Res 11:972–989

    Google Scholar 

  • Loiola E, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176:657–690

    Google Scholar 

  • Lovasz L, Schrijver A (1991) Cones of matrices and set-functions, and 0-1 optimization. SIAM J Optim 1:166–190

    Google Scholar 

  • Nugent CE, Vollmann TE, Ruml J (1986) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16:150–173

    Google Scholar 

  • Pierce JF, Crowston WB (1971) Tree-search algorithms for the quadratic assignment problem. Nav Res Logist Quart 18:1–36

    Google Scholar 

  • Povh J, Rendl F (2009) Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim 36:231–241

    Google Scholar 

  • Ramachandran B, Pekny JF (1998) Lower bounds for nonlinear assignment problems using many body interactions. Eur J Oper Res 105:202–215

    Google Scholar 

  • Rendl F, Sotirov R (2007) Bounds for the quadratic assignment problem using the bundle method. Math Program B 109:505–524

    Google Scholar 

  • Resende MGC, Ramakrishnan KG, Drezner Z (1995) Computing lower bounds for the quadratic assignment with an interior point algorithm for linear programming. Oper Res 43:781–791

    Google Scholar 

  • Wagner H M, Whitin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96

    Google Scholar 

  • Zhao Q, Karisch SE, Rendl F, Wolkowicz H (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Comb Optim 2:71–109

    Google Scholar 

Download references

Acknowledgements

The authors would like to recognize and thank Kurt Anstreicher and Samuel Burer for their suggestions. The second author wishes to thank Renata Sotirov for many stimulating discussions on the quadratic assignment problem.

Author information

Authors and Affiliations

  1. Tippie College of Business, University of Iowa, 52242-1994, Iowa City, IA, USA

    Timothy J. Lowe

  2. Joseph M. Katz Graduate School of Business, University of Pittsburgh, 15260, Pittsburgh, PA, USA

    Richard E. Wendell

Authors
  1. Timothy J. Lowe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard E. Wendell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Timothy J. Lowe .

Editor information

Editors and Affiliations

  1. Faculty of Business Administration, University of New Brunswick, Fredericton,, New Brunswick, Canada

    H. A. Eiselt

  2. Depto. Ingenieria Electrica, Pontificia Universidad Católica de Chile, Av. Vicuna Mackenna 4860, Macul, Santiago, Chile

    Vladimir Marianov

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Lowe, T.J., Wendell, R.E. (2011). Exact Solution of Two Location Problems via Branch-and-Bound. In: Eiselt, H., Marianov, V. (eds) Foundations of Location Analysis. International Series in Operations Research & Management Science, vol 155. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7572-0_13

Download citation

Publish with us

Policies and ethics

Search

Navigation