Advertisement

Path Length Problems and Dynamic Programming

  • Eric V. Denardo
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 149)

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Yale UniversityNew HavenUSA

Personalised recommendations