Free Access
Issue
R.A.I.R.O. Recherche opérationnelle
Volume 8, Number V2, 1974
Page(s) 31 - 37
DOI https://doi.org/10.1051/ro/197408V200311
Published online 06 February 2017
  • B. ROY, Algèbre moderne et théorie des graphes, Tome II, Dunod, 1970, pp. 127-161. [MR: 260413]
  • S. E. DREYFUS, An Appraisal of some shortest path Algorithm, Operational Research, 1969, 17, n° 3. [Zbl: 0172.44202]
  • G. B. DANTZIG, Linear Programming and extensions, Princeton university Press, pp. 361-366, 1963. [MR: 201189] [Zbl: 0997.90504]
  • W. L. PRICE, Graphs an Network An Introduction, Operational Research Series Butterworks, Chapitre III, pp. 46-59. [Zbl: 0258.90046]
  • L. R. FORD Jr et D. R. FULKERSON, Flows in Network, Princeton University Press, pp. 130-134, 1962. [MR: 159700] [Zbl: 1216.05047]
  • J. Y. YEN, An algorithm for finding shortest Routes from ail source nodes to a givendestination in General networks, Quaterly of Appl. Maths, 1969, 27, pp. 526-530. [MR: 253822] [Zbl: 0207.54903]
  • B. A. CARRÉ, An elimination method for Minimal cost network flow Problem, Large sparse sets of linear equations, J. K. Reid, Academic Press, 1971, pp. 191-209. [MR: 371381]
  • B. A. CARRÉ, An algebra for Network routing problems, J. Inst Maths Applics, 1971; 7, pp. 273-294. [MR: 292583] [Zbl: 0219.90020]
  • M. PETITFRÈRE, Sur l'algorithme de Dijkstra pour l'obtention des plus courts cheminsdans un graphe, Cahier du Centre d'Etude de R. O., Vol. 13, n° 3, 1971, pp. 111-123. [MR: 312998] [Zbl: 0235.90054]
  • G. FONTAN, Sous programmes de recherche de chemins minimaux dans un graphe, Note Interne L.A.A.S., n° 73 I 14, mai 1973.
  • KNUTH, The art of computer programming, vol. 1, Fundamental Algorithm, Addison Wesley, 1972, pp. 228-304.

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.