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

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.

This publication has 0 references indexed in Scilit: