Network Models

H. A. Eiselt () and C. -L. Sandblom ()
Additional contact information
H. A. Eiselt: University of New Brunswick
C. -L. Sandblom: Dalhousie University

Chapter 5 in Operations Research, 2010, pp 177-215 from Springer

Abstract: Abstract Graph theory, the subject at the root of this chapter, dates back to 1736, when the Swiss mathematician Leonard Euler considered the now famed “Königsberg bridge problem.” At that time, there were seven bridges across the River Pregel that ran through the city of Königsberg on the Baltic Sea, and Euler wondered whether or not it would be possible to start somewhere in the city, walk across each of the bridges exactly once, and return to where he came from. (It was not). We will return to Euler’s problem in Section 5.5 of this chapter. Two hundred years later in 1936, the Hungarian mathematician Denès König wrote the seminal book “The Theory of Finite and Infinite Graphs,” that laid the foundations of modern graph theory. The subject was first used by operations researchers in the 1950s, most prominently by L.R. Ford and D.R. Fulkerson.

Keywords: Short Path; Travel Salesman Problem; Short Path Problem; Node Capacity; Network Flow Problem (search for similar items in EconPapers)
Date: 2010
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-3-642-10326-1_5

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

DOI: 10.1007/978-3-642-10326-1_5

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 ().