Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 333-357. 
@article{RO_1996__30_4_333_0,
     author = {Prins, C.},
     title = {Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {333--357},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {4},
     year = {1996},
     mrnumber = {1427447},
     zbl = {0862.90123},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1996__30_4_333_0/}
}
TY  - JOUR
AU  - Prins, C.
TI  - Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1996
SP  - 333
EP  - 357
VL  - 30
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1996__30_4_333_0/
LA  - fr
ID  - RO_1996__30_4_333_0
ER  - 
%0 Journal Article
%A Prins, C.
%T Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1996
%P 333-357
%V 30
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1996__30_4_333_0/
%G fr
%F RO_1996__30_4_333_0
Prins, C. Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 333-357. http://archive.numdam.org/item/RO_1996__30_4_333_0/

1. R. K. Ahuja, K. Melhorn, J. B. Orlin et R. E. Tarjan, Faster algorithms for the shortest path problem, Technical Report 193, MIT Operations Research Center, 1988. | Zbl

2. D. Beauquier, J. Berstel et Ph. Chrétienne, Éléments d'algorithmique, Masson, 1992.

3. T. H. Cormen, C. L. Leiserson, R. L. Rivest, Introduction to algorithms, The MIT Press, 1992. | Zbl

4. E. Denardo et B. Fox, Shortest-route methods. 1. Reaching, pruning and buckets, Operations Research, 1979, 27, p. 161-186. | MR | Zbl

5. R. Dial, Algorithm 360: Shortest path forest with topological ordering, Communications of the ACM, 1969, 72, p. 632-633.

6. J. J. Divoky, M. S. Hung, Performance of shortest path algorithms in network flow problems, Management Science, 1990, 36, (6), p.661-673. | MR | Zbl

7. G. N. Frederickson, Fast algorithms for shortest paths in planar graphs with applications, SIAM Journal on Computing, 1987, 16, (6), p. 1004-1022. | MR | Zbl

8. F. Glover, R. Glover et D. Klingman, Computational study of an improved shortest path algorithm, Networks, 1984, 14, p. 25-36.

9. F. Glover, D. Klingman et N. V. Phillips, A new polynomially bounded shortest path algorithm, Opérations Research, 1985, 33, (1), p.65-73. | MR | Zbl

10. F. Glover, D. Klingman, N. V. Phillips et R. F. Schneider, New polynomial shortest path algorithms and their computational attributes, Management Science, 1985, 31, (9), p. 1106-1129. | MR | Zbl

11. M. Gondran et M. Minoux, Graphes et Algorithmes, Eyrolles, 1979. | MR | Zbl

12. M.S. Hung et J. J. Divoky, A computational study of efficient shortest path algorithms, Computers and Operations Research, 1988, 15, (6), p. 567-576. | MR | Zbl

13. D. Klingman, R. F. Schneider, Microcomputer-based algorithms for large scale shortest path problems, Discrete Applied Mathematics, 1986, 73, p. 183-206. | MR | Zbl

14. M. Minoux, Programmation mathématique, Masson, 1983 (2 volumes). | Zbl

15. J. A. Mchugh, Algorithmic graph theory, Prentice Hall, 1990. | Zbl

16. U. Pape, Algorith 562: shortest path lengths, ACM Trans. Math. Software, 1980, 5, p.450-455. | Zbl

17. J. Pearl, Heuristics, Addison-Wesley, 1984.

18. C. Prins, Calcul sur micro-ordinateur de plus courts chemins dans les grands graphes peu denses, Rapport DAP-93-11, Département d'Automatique et Productique, École des Mines de Nantes.

19. R. Sedgewick et J. S. Vitter, Shortest paths in euclidean graphs, Algorithmica, 1986, 1, p. 31-48. | MR | Zbl

20. M. Syslo, N. Deo et J. S. Kowalik, Discrete optimization algorithms with Pascal programs, Prentice Hall, 1993. | Zbl

21. R. E. Tarjan, Data structures and network algorithms, SIAM, 1983. | MR | Zbl