Letter to the Editor---A Variant on the Shortest-Route Problem

George J. Minty
Additional contact information
George J. Minty: Institute for Research in Productivity, Waseda University, Tokyo, Japan

Operations Research, 1958, vol. 6, issue 6, 882-883

Abstract: The shortest-route problem has been treated by Dantzig [1] with the simplex-method, by Bellman [2] with ‘dynamic programming,’ and by the author with a simple analog computer [3] and with an algorithm derived from a hydraulic analog (unpublished). There is a simple variant on this problem the solution of which is obvious, and yet it does not fit into the formal structure of any of these theories. I present the problem and its solution less for their intrinsic interest than because they may suggest other solvable problems.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.6.882 (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:6:y:1958:i:6:p:882-883

Access Statistics for this article

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