Free Access
Issue
RAIRO-Oper. Res.
Volume 15, Number 2, 1981
Page(s) 165 - 184
DOI https://doi.org/10.1051/ro/1981150201651
Published online 06 February 2017
  • 1. B. A. CARRE, An Algebra for Network Routing Problems, J. Inst Math. Appl., vol. 7, 1971, p. 273-294. [MR: 292583] [Zbl: 0219.90020]
  • 2. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, 1963. [MR: 201189] [Zbl: 0997.90504]
  • 3. G. B. DANTZIG, On a Shortest Route Through a Network, Manag. Sc., vol. 6, 1960, p. 187-189. [MR: 113815] [Zbl: 0995.90518]
  • 4. R. B. DIAL, A Probabilistic Multipath Traffic Assignment Model which Obviates Path Enumeration, Transp. Res., vol. 5, 1971, p. 83-111.
  • 5. E. DURAND, Solutions numériques des équations algébriques, tome II, Masson, Paris 1961. [Zbl: 0099.10801]
  • 6. P. H. FARGIER, Une méthode de détermination de réseau optimal, février 1977, I.R.T.
  • 7. J. FONLUPT, L'affectation exponentielle et le problème du plus court chemin dans un graphe, Séminaire Analyse numérique n° 275, Mathématiques appliquées, Université scientifique et médicale de Grenoble. [Zbl: 0457.90078]
  • 8. M. GONDRAN, Algèbre linéaire et cheminement dans un graphe, R.A.I.R.O., 1975, p. 77-98. [EuDML: 104611] [MR: 371724] [Zbl: 0311.90071]
  • 9. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, 1970. [MR: 274683] [Zbl: 0932.90001]

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.