Free Access
Issue
RAIRO-Oper. Res.
Volume 26, Number 2, 1992
Page(s) 139 - 152
DOI https://doi.org/10.1051/ro/1992260201391
Published online 06 February 2017
  • 1. M. S. BAZARAA et R. W. LANGLEY, A Dual Shortest Path Algorithm, J. S.I.A.M., 1974, 26, 3, p. 496-501. [MR: 347376] [Zbl: 0251.90051]
  • 2. C. BERGE, Graphes, Gauthier-Villars, Paris, 1987. [Zbl: 0531.05031]
  • 3. C. BERGE et A. GHOUILA-HOURI, Programmes, jeux et réseaux de transport, Dunod, Paris, 1962. [MR: 192912] [Zbl: 0111.17302]
  • 4. G. B. DANTZIG, W. O. BLATTNER et M. R. RAO, All Shortest Routes from a Fixed Origin in a Graphe, dans Théorie des graphes, Journées Internationales d'Étude, Rome, juillet 1966, Dunod, Paris, 1967. [MR: 221980] [Zbl: 0189.24103]
  • 5. A. V. KARZANOV, Determining the Maximal Flow in a Network with the Method of Preflows, Soviet Math. Dokl., 1974, 15, p. 434-437. [Zbl: 0303.90014]
  • 6. V. M. MALHOTRA, M. P. KUMAR et S. N. MAHESHWARI, An O (| V|³) Algorithm for Finding Maximum Flows in Networks, Inform. Process. Lett., 1978, 7, 6, p. 277-278. [MR: 509428] [Zbl: 0391.90041]
  • 7. M. MINOUX, Programmation mathématique, Dunod, Paris, 1983. [Zbl: 0546.90056]
  • 8. G. L. NEMHAUSER, A Generalized Permanent Label Setting Algorithm for the Shortest Path Between Specified Nodes, J. Math. Anal. Appl., 1972, 38, p. 328-334. [MR: 309540] [Zbl: 0234.90063]
  • 9. M. SIMMONARD, Programmation linéaire, Dunod, Paris, 1962. [MR: 138505] [Zbl: 0115.37902]

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.