Book chapter
Exact Solution of Two Location Problems via Branch-and-Bound
Foundations of Location Analysis, pp.291-314
International Series in Operations Research & Management Science, v. 155, Springer
2011
DOI: 10.1007/978-1-4419-7572-0_13
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.
Details
- Title: Subtitle
- Exact Solution of Two Location Problems via Branch-and-Bound
- Creators
- Timothy J. Lowe - University of IowaRichard E. Wendell - University of Pittsburgh
- Contributors
- H A Eiselt (Editor)Vladimir Marianov (Editor)
- Resource Type
- Book chapter
- Publication Details
- Foundations of Location Analysis, pp.291-314
- Series
- International Series in Operations Research & Management Science; v. 155
- DOI
- 10.1007/978-1-4419-7572-0_13
- eISSN
- 2214-7934
- ISSN
- 0884-8289
- Publisher
- Springer; New York
- Number of pages
- 24
- Language
- English
- Date published
- 2011
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963210702771
Metrics
2 Record Views