Variations sur un algorithme de DANTZIG : application à la recherche des plus courts chemins dans les grands réseaux
RAIRO - Operations Research - Recherche Opérationnelle, Volume 7 (1973) no. V1, p. 53-61
@article{RO_1973__7_1_53_0,
     author = {Grassin, J. and Minoux, M.},
     title = {Variations sur un algorithme de DANTZIG : application \`a la recherche des plus courts chemins dans les grands r\'eseaux},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     publisher = {EDP-Sciences},
     volume = {7},
     number = {V1},
     year = {1973},
     pages = {53-61},
     zbl = {0259.90052},
     mrnumber = {327569},
     language = {fr},
     url = {http://www.numdam.org/item/RO_1973__7_1_53_0}
}
Grassin, J.; Minoux, M. Variations sur un algorithme de DANTZIG : application à la recherche des plus courts chemins dans les grands réseaux. RAIRO - Operations Research - Recherche Opérationnelle, Volume 7 (1973) no. V1, pp. 53-61. http://www.numdam.org/item/RO_1973__7_1_53_0/

[1] Floyd R. W., Algorithm 97 : Shortest path, CACM 5 (6), 1962, 345.

[2] Yen Jin. Y., Finding the lengths of all shortest paths in N-Node Non-negative-Distance Complete Networks using l /2 N3 additions and N3 Comparisons , J.A.C.M., vol. 19, n° 3, july 1972, pp. 423-424. | Zbl 0242.94028

[3] Dantzig G. G., All shortest routes in a graph, Tech. Rep. n° 66-3, november 1966, Stanford Univ. California. | MR 221981

[4] Hu T. C., Integer programming and network flows, pp. 161-168, Addison Wesley 1969. | MR 263420