Reoptimization procedures in shortest path problem

M. S. Bazaraa, R. W. Langley (1974),A Dual Shortest Path Algorithm, “SIAM J. Appl. Math.”, vol. 26, 496–501.

G. B. Dantzig (1960),On the shortest route through a Network, “Management Sci.”, vol. 6, 187–190.

E. V. Denardo, B. L. Fox (1979),Shortest Route Methods: 1.Reaching, Pruning, Buckets, “Operations Research,”, vol. 27, 161–186.

R. Dial (1969),Algorithm 360Shortes Path Forest with topological ordering, “Communications of the A.C.M.”, vol. 12, 632–633.

R. Dial, F. Glover, D. Karney, D. Klingman (1977),A computational Analysis of alternative algorithms and labeling techniques for finding shortest path trees, Research Report CCS, The University of Texas at Austin, Texas.

R. Dionne (1973).Etude et extension d'un algorithme de Murchland, publication n. 122, Dép. d'Informatique, Université de Montréal.

S. E. Dreyfus (1969),An appraisal of some Shortest-Path algorithms, “Operations Research”, vol. 17, 395–412.

M. Florian (1977),An improved linear approximation algorithm for the network equilibrium (Packet Switching) problem, Proc. of IEEE Conf. on Decision and Control.

J. Gilsinn, C. Witzgall (1973),A performance comparison of labeling algorithms for calculating shortest path trees, NBS Tech. Note 772, U.S. Dept. of Commerce.

J. D. Murchland (1970),A fixed matrix method for all shortest distances in a directed graph and for the inverse problem, PhD thesis, University of Karlsruhe.

G. L. Nemhauser (1972),A Generalized Permanent Label Setting Algorithm for the Shortest Path between Specified Nodes, “J. of Math. Analysis and Appl.”, vol. 38, 328–334.

S. Nguyen (1976),A unified approach to equilibrium methods for Traffic assignment, “Traffic Equilibrium Methods”, M.A. Florian ed., Springer Verlag.

D. W. Robinson (1976),Analysis of a Shortest Path algorithm for transportation applications, Control Analysis Corporation, Tech. Report.

D. Van Vliet (1978),Improved Shortest Path algorithms for transportation Networks, “Transp. Res.”, vol. 10, 7–20.

B. Yaged (1971),Minimum cost routing for static network models “Networks,” vol. 3, 315–331.