Path Length Problems and Dynamic Programming

Eric V. Denardo ()
Additional contact information
Eric V. Denardo: Yale University

Chapter Chapter 8 in Linear Programming and Generalizations, 2011, pp 269-295 from Springer

Abstract: Abstract This is the first of a pair of chapters that deal with optimization problems on “directed networks.” This chapter is focused on path-length problems, the next on network-flow problems. Path-length problems are ubiquitous. A variety of path-length problems will be posted in this chapter. They will be solved by linear programming and, where appropriate, by other methods.

Keywords: Short Path; Completion Time; Critical Path; Road Segment; Directed Network (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-6491-5_8

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

DOI: 10.1007/978-1-4419-6491-5_8

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