Letter to the Editor---The Shortest-Route Problem---An Addendum

S. N. Narahari Pandit
Additional contact information
S. N. Narahari Pandit: Indian Institute of Technology, Kharagpur, India

Operations Research, 1961, vol. 9, issue 1, 129-132

Abstract: A rapidly convergent method for finding the optimal routing matrix of a given network is illustrated. The optimality criterion is generalized by incorporating into it the visit costs at the various nodes.

Date: 1961
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.1.129 (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:1:p:129-132

Access Statistics for this article

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