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

Timothy J. Lowe () and Richard E. Wendell ()
Additional contact information
Timothy J. Lowe: University of Iowa
Richard E. Wendell: University of Pittsburgh

Chapter Chapter 13 in Foundations of Location Analysis, 2011, pp 291-314 from Springer

Abstract: 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.

Keywords: Assignment Problem; Travel Salesman Problem; Variable Neighborhood Search; Dual Solution; Demand Point (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-7572-0_13

Ordering information: This item can be ordered from
http://www.springer.com/9781441975720

DOI: 10.1007/978-1-4419-7572-0_13

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().