Letter to the Editor---The k th Best Route Through a Network

Maurice Pollack
Additional contact information
Maurice Pollack: Stanford Research Institute, Menlo Park, California

Operations Research, 1961, vol. 9, issue 4, 578-580

Abstract: Determining the shortest route through a network is a problem for which many solutions have appeared. Not so well known, but of equal importance, is the generalized problem of determining the k th best route through a network. The purpose of this Letter is to present a formulation of the generalized problem, to reference several known solutions, and to describe a new simple method of solution which possesses some advantages.

Date: 1961
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.4.578 (application/pdf)

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:inm:oropre:v:9:y:1961:i:4:p:578-580

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().