Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Shortest-route problem

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_948

A network problem in which one wants to find the shortest route from a home node to a destination node, or the shortest routes from a home node to all other nodes. This is a linear-programming problem and can be solved by the simplex method, but special shortest route algorithms exist that are computationally more efficient. Dijkstra's algorithm; Simplex method.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA