| |
Table des matières de ce fascicule | Article précédent | Article suivant
Boffey, Brian
The all-to-all alternative route problem. Revue française d'automatique, d'informatique et de recherche opérationnelle. Recherche opérationnelle, 27 no. 4 (1993), p. 375-387
Texte intégral djvu | pdf | Analyses MR 1250363 | Zbl 0789.90030
URL stable: http://www.numdam.org/item?id=RO_1993__27_4_375_0
1. M. BEN-AKIVA, A. D. PALMA and I. KAYSI, Dynamic Network Models and Driver Information Systems, Transpn. Res. A., 1991, 25A, pp. 251-266.
2. D. R BERTSEKAS and R. GALLAGER, Data Network, 1987, Prentice-Hall, Englewood Cliffs, NJ. Zbl 0734.68006
3. T. B. BOFFEY, Distributed Computing: Associated Combinatorial Problems, 1992, Blackwell Scientific Publications, Oxford.
4. M. FLORIAN, S. NGUYEN and S. PALLOTTINO, A Dual Simplex Algorithm for Finding all Shortest Paths, Networks, 1981, 11, pp. 367-378. MR 645113 | Zbl 0471.90085
5. G. GALLO and S. PALLOTTINO, Shortest Path Methods: a Unifying Approach, Math. Prog. Study, 1986, 26, pp. 38-64. MR 830485 | Zbl 0605.90123
6. P. HART, N. NILSSON and B. RAPHAEL, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. Syst. Man Cybernet., 1968, 4, pp. 100-107.
7. G. J. HORNE, Finding the K Least Cost Paths in an Acyclic Activity Network, J. Opl Res. Soc. 1980, 31, pp. 443-448.
8. C. L. MONMA and D. F. SHALLCROSS, Methods for Designing Communications Networks with Two-Connected Survivability Constraints, Oper. Res., 1989, 37, pp. 531-541.
9. G. L. NEMHAUSER, A Generalized Permanent Label Setting Algorithm for the Shortest Path Between all Nodes J. Math. Analysis & Applic, 1972, 38, pp. 328-334. MR 309540 | Zbl 0234.90063
10. N. J. NILSSON, Problem Solving Methods in Artificial Intelligence, 1971, McGraw-Hill, New York.
11. A. PERKO, A Representation of Disjoint Sets with Fast Initialization, Information Processing Lett., 1983, 16, p. 21
12. A. PERKO, Implementation of Algorithms for K Shortest Loopless Paths, Networks, 1986, pp. 149-160. MR 835634 | Zbl 0642.90097
13. H. RUDIN, On Routing and Delta Routing: a Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks, IEEE Trans. Commun., 1976, COM-24, pp. 43-59.
14. D. M. TOPKIS, A k Shortest Path Algorithm for Adaptive Routing in Communication Networks, IEEE Trans. Commun., 1988, COM-36, pp. 855-859. MR 948321 | Zbl 0654.90021
|
|
Copyright Cellule MathDoc 2013 | Crédit | Plan du site
|
