Single Flow Routing Through a Network

Marc Goetschalckx ()
Additional contact information
Marc Goetschalckx: Georgia Institute of Technology

Chapter Chapter 6 in Supply Chain Engineering, 2011, pp 155-180 from Springer

Abstract: Abstract After you have studied this chapter, you should: Know the classification system for vehicle routing problems and algorithms. For the class of single-flow routing problems you should know: The characteristics of the base problem and various variants. The mathematical formulation. Dijkstra’s solution algorithm. How to solve problems of modest size with a computer program.

Keywords: Short Path; Source Node; Destination Node; Critical Path; Sink Node (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-6512-7_6

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

DOI: 10.1007/978-1-4419-6512-7_6

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