Classical Techniques

Kathryn A. Dowsland ()
Additional contact information
Kathryn A. Dowsland: Gower Optimal Algorithms Ltd

Chapter Chapter 2 in Search Methodologies, 2014, pp 19-65 from Springer

Abstract: Abstract The purpose of this chapter is to provide an introduction to three classical search techniques—branch and bound, dynamic programming and network flow programming—all of which have a well established record in the solution of both classical and practical problems. All three have their origins in, or prior to, the 1950s and were the result of a surge in interest in the use of mathematical techniques for the solution of practical problems. The timing was in part due to developments in Operations Research in World War II, but was also spurred by increasing competition in the industrial sector and the promise of readily accessible computing power in the foreseeable future.

Keywords: Knapsack Problem; Transportation Problem; Network Flow; Demand Point; Network Flow Problem (search for similar items in EconPapers)
Date: 2014
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:sprchp:978-1-4614-6940-7_2

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

DOI: 10.1007/978-1-4614-6940-7_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().