Solutions of the Shortest-Route Problem---A Review

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

Operations Research, 1960, vol. 8, issue 2, 224-230

Abstract: Several methods are available for determining the shortest route through a network. These methods are described in some detail with added remarks as to their relative merits. Most of the methods are intended for both manual and digital computation, however, two analog methods are included. Brief mention is also made of the duality between the shortest-route problem and the network capacity problem.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.2.224 (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:8:y:1960:i:2:p:224-230

Access Statistics for this article

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