Letter to the Editor---The Shortest-Route Problem
Robert M. Peart,
Paul H. Randolph and
T. E. Bartlett
Additional contact information
Robert M. Peart: Purdue University, Lafayette, Indiana
Paul H. Randolph: Purdue University, Lafayette, Indiana
T. E. Bartlett: Purdue University, Lafayette, Indiana
Operations Research, 1960, vol. 8, issue 6, 866-868
Abstract:
This letter is a supplement to the excellent review of solutions of the shortest-route problem by Pollack and Wiebenson [Pollack, M., W. Wiebenson. 1960. Solutions of the shortest-route problem---A review. Opns. Res. 8 224--230.] in the March--April, 1960 issue of O perations R esearch . Four additional solutions are presented, two of which are linear programming methods related to Dantzig's tree method [Dantzig, G. B. 1957. Discrete-variable extremum problems. Opns. Res. 5 266--277.] mentioned in the article.
Date: 1960
References: Add references at CitEc
Citations:
Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.6.866 (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:6:p:866-868
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().