Free Access
Issue
RAIRO-Oper. Res.
Volume 20, Number 3, 1986
Page(s) 199 - 211
DOI https://doi.org/10.1051/ro/1986200301991
Published online 06 February 2017
  • RATP, Calcul de chemins devaleurs minimales appliqué aux études de réseaux ferroviaires urbains. Oct. 1970, vol. 1 et 2.
  • RATP, Critère d'accessibilité urbaine. Application aux transports en commun dans Paris intra-muros, mai 1974.
  • B. ROY et D. GALLAND, Énumération des chemins ε-admissibles entre deux points, RAIRO verte septembre 73, 1972.
  • D. R. SHIER, Onalgorithms for finding the k shortest paths in a network, Networks, vol. 9, p. 195-214, 1979. [MR: 546997] [Zbl: 0414.68034]
  • GONDRAN et MINOUX, Graphes et algorithmes, Paris Eyrolles, 1979. [MR: 615739] [Zbl: 0497.05023]
  • E. W. DIJKSTRA, A note on two problems in connexion with graphs, Numerische Mathematik 1, p. 269-271, 1959. [EuDML: 131436] [MR: 107609] [Zbl: 0092.16002]
  • B. MEYER et C. BAUDOUIN, Méthodes de Programmation, Eyrolles, 1978. [Zbl: 0407.68002]
  • A. V. AHO, J. E. HOPCROF, J. D. ULLMAN, Data structures and algorithms, Addison-Wesley, 1983. [MR: 666695] [Zbl: 0487.68005]
  • I. PAUMELLE, Thèse de 3 cycle, Université Paris-Dauphine. Un outil informatique d'aide aux usagers des transports en commun. Application au réseau d'autobus parisien, juin 1984.

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.