Walter Hoffman
- 1 A method for solving this problem different from the one presented herein 18 given in an unpublished manuscript by Bock, Kantner, and Haynes of the Armour Research Foundation.Google Scholar
- 2 MOORE, EDWARD F , The shortest path through a maze, paper presented at the International Symposium on the Theory of Switching at Harvard University (1957)Google Scholar
- 3 DANTZIG, GEORGE B , The shortest route problem, Operatwns Research 5, (1957), 270- 273.Google Scholar
- 4 MOORE, op. cir.Google Scholar
- 5 F. (~ BOCK, Phase Report No. 1, Algorithm for finding shortest paths between pairs of points in a network, ARF Project E 084, June, 1957.Google Scholar
Index Terms
- A Method for the Solution of the Nth Best Path Problem
Recommendations
An Infeasible Path-Following Method for Monotone Complementarity Problems
We propose an infeasible path-following method for solving the monotone complementarity problem. This method maintains positivity of the iterates and uses two Newton steps per iteration---one with a centering term for global convergence and one without ...
Shortest path problem with uncertain arc lengths
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, ...
The semismooth Newton method for the solution of quasi-variational inequalities
We consider the application of the globalized semismooth Newton method to the solution of (the KKT conditions of) quasi variational inequalities. We show that the method is globally and locally superlinearly convergent for some important classes of ...
Comments