Free Access
| Issue |
R.A.I.R.O. Recherche opérationnelle
Volume 7, Number V3, 1973
|
|
|---|---|---|
| Page(s) | 3 - 20 | |
| DOI | https://doi.org/10.1051/ro/197307V300031 | |
| Published online | 06 February 2017 | |
- BALAS E., An additive algorithm for solving linear programs with zero-one variables, Operations Research, 1965, 13, 517-549. [MR: 183535] [Zbl: 0133.42701] [Google Scholar]
- BELLMAN R. and KALABA R., On the Kth best policies, Journal of the Society for Industrial and Applied Mathematics, 1960, 8, 582-588. [MR: 122581] [Zbl: 0096.34304] [Google Scholar]
- [2 bis] BRAGARD L. et GALLAND D., Le programme Multichemin : manuel de références, Document Technique n° 27, mars 1972, Direction Scientifique, Groupe METRA. [Google Scholar]
- CLARKE S., KRIKORIAN A. and RAUSEN J., Computing the N best loopless paths in a network, Journal of the Society for Industrial and Applied Mathematics, 1963, 11, 1096-1102. [MR: 160435] [Zbl: 0217.29003] [Google Scholar]
- DANTZIG G. B., BLATTNER W. O. and RAO M.R., All shortest routes from a fixed origin in an graph, Théorie des graphes, Journées Internationales d'Études Rome, 1966 (Dunod, Paris, 1967). [Zbl: 0189.24103] [Google Scholar]
- DREYFUS S. E., An appraisal of some shortest path algorithms, Operations Research, vol. 17, n° 3, 1969. [Zbl: 0172.44202] [Google Scholar]
- [5 bis] FAYEIN V., Chemins-minimaux dans un graphe valué, Colloque de Recherche Opérationnelle du Comité International des Métros, Milan, mai 1972. [Google Scholar]
- HANSEN P., Les procédures d'optimisation par séparation : présentation général Revue de Statistique, Tijdschrift voor Statistiek, 11 (3), 1971. [Google Scholar]
- HOFFMAN W. and PAVLEY R., A method for the solution of the Nth best path problem. Journal of the Association for Computing Machinery, 1959, 6, 506-514. [MR: 129019] [Zbl: 0100.13103] [Google Scholar]
- KAUFMAN A. et CRUON R., Etude de la sensibilité en programme dynamique; Politiques k-optimales en avenir certain, Revue Française de Recherche Opérationnelle n° 32, 1964. [Zbl: 0129.34203] [Google Scholar]
- [8 bis] LAWLER E. L., A procedure for Computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Management Science, vol. 18, n° 7, March 1972. [MR: 292489] [Zbl: 0234.90050] [Google Scholar]
- PAIR C. et DERNIAME J. C., Problèmes de cheminement dans les graphes, Monographies d'informatique AFCET (Dunod, 1971). [Zbl: 0243.05117] [Google Scholar]
- PICHAT E., Contribution à l'algorithmique non numérique dans les ensembles ordonnés, Thèse Université de Grenoble (1970). [Google Scholar]
- PLOWDEN S., Note interne Metra Consulting Group Ltd, 1969. [Google Scholar]
- POLLACK M., Solutions of the Kth best route through a network, Journal of Mathematical Analysis and Applications, 1961, 3, 547-559. [Zbl: 0112.12105] [Google Scholar]
- POLLACK M., The Kth best route through a network, Operations Research, 1961,9, 578-580. [Zbl: 0096.35403] [Google Scholar]
- [14] Regie autonome des transports parisiens, Programme de recherche des chemins les meilleurs entre deux stations du réseau métropolitain, Service de l'Informatique, 1971. [Google Scholar]
- ROY B., Procédures d'Exploration par Séparation et Evaluation (PSEP, PSES), RIRO, n° V-l, 1969. [Zbl: 0218.90032] [Google Scholar]
- ROY B., Algèbre Moderne et Théorie des Graphes orientées vers les sciences économiques et sociales, Tomes 1 et 2 (Dunod, Paris, 1969-1970). [Zbl: 0238.90072] [Google Scholar]
- ROY B. An algorithm for a general constrained set covering problem, Computing and Graph Theory, Ronald C. Read, Academic Press Inc., New York, 1972. [MR: 340061] [Zbl: 0255.05006] [Google Scholar]
- SAKAROVITCH M., The K shortest chains in a graph, Transportation Research, 1968, 2, 1-11. [Google Scholar]
- SAKAROVITCH M., Les k plus courts chemins élémentaires dans un graphe, Note interne Institut de Recherche des Transports. [Google Scholar]
- YEN J. Y., Finding the K shortest loopless paths in a network, Management Science, vol. 17, n° 11, 1971, 712-716. [MR: 300782] [Zbl: 0218.90063] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.