Free Access
Issue
R.I.R.O.
Volume 1, Number 5, 1967
Page(s) 133 - 139
DOI https://doi.org/10.1051/m2an/1967010501331
Published online 01 February 2017
  1. R. BELLMAN, On a routing problem, Quart. Appl. Math.,16 (1958). [MR: 102435] [Zbl: 0081.14403] [Google Scholar]
  2. C. BERGE, Théorie des graphes et ses applications, Dunod, Paris, 1963. [MR: 155312] [Zbl: 0121.40101] [Google Scholar]
  3. A. KAUFMANN, Méthodes et modèles de la Recherche opérationnelle, tome 2, Dunod, Paris, 1964. [MR: 202463] [Zbl: 0128.39501] [Google Scholar]
  4. Gr. C. MOISIL, Asupra unor reprezent_ri ale grafurilor ce intervin în probleme de economia transporturilor, Comunic_rile Acad. R.P.R., nr. 8, X, 1960. [Google Scholar]
  5. B. ROY, Transitivité et connexité, C.R. Acad. Sci. Paris, tome 249, 1959, p. 216-218. [MR: 109792] [Zbl: 0092.15902] [Google Scholar]
  6. I. TOMESCU, Metod_ pentru determinarea drumului de cea mai mic_ lungime dintre dou_ noduri ale unui graf finit, Analele Univ. Bucure_ti, nr. 2, 1966. [Google Scholar]
  7. I. TOMESCU, Sur les méthodes matricielles dans la théorie des réseaux, C.R. Acad. Sci. Paris, tome 263, 1966, p. 826-829. [MR: 207395] [Zbl: 0152.14702] [Google Scholar]
  8. L. NOLIN, Traitement des données groupées, Publication de l'Institut Blaise-Pascal, Paris, mai 1964. [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.

Recommended for you