Free Access
Issue
R.A.I.R.O. Recherche opérationnelle
Volume 9, Number V3, 1975
Page(s) 21 - 40
DOI https://doi.org/10.1051/ro/197509V300211
Published online 06 February 2017
  • M. MINOUX, Planification à court et à moyen terme d'un réseau de télécommunications, Annal. Télécomm., 29, n°s 5-6, novembre-décembre 1974. [MR: 376132]
  • J. A. TOMLIN, Minimum cost multicommodity networks flows, Operations Research, 14 (1), février 1966, p. 45-51.
  • G. B. DANTZIG, Linear programming and extensions, Princeton University Press, 1963. [MR: 201189] [Zbl: 0997.90504]
  • T. C. HU, Integer Programming and network flows, Addison-Wesley, 1969. [MR: 263420] [Zbl: 0197.45701]
  • L. S. LASDON, Optimization theory for large Systems, Macmillan Series for Operations Research, 1970. [MR: 337317] [Zbl: 0224.90038]
  • G. B. DANTZIG et R. M. VAN-SLYKE, Generalized upper boonding techniques, J. Computer System Science, 1, 1967, p. 213-226. [MR: 230541] [Zbl: 0162.23003]
  • M. MINOUX, Le problème de l'admissibilité d'un réseau parcouru par des flots multiples, Note technique ITD/CES/59, CNET, mars 1972.
  • K. ONAGA et O. KAKUSHO, On feasibility conditions of multicommodity flows in networks, I.E.E.E. Transactions on circuit theory, 18, n° 4, juillet 1971, p. 425-429. [MR: 395780]
  • L. FRATTA, M. GERLA et L. KLEINROCK, The flow deviation method: an approach to store and forward communication network design, Networks, 3, n° 3, 1973, p. 97-133. [MR: 312994] [Zbl: 1131.90321]
  • H. FRANK et W. CHOU, Routing in computer networks, Networks, 1, n° 2, 1971, p. 99-112. [Zbl: 0234.94027]
  • L. R. FORD et D. R. FULKERSON, A suggested computation for maximal multicommodity network flows, Management Science, 5, 1958, p. 97-101. [MR: 97878] [Zbl: 0995.90516]
  • R. SAIGAL, Multicommodity flows in directed networks, University of California, Berkeley, Ph. D., 1968.
  • W. S. JEWELL, Multicommodity network solutions in Théorie des Graphes, Rome 1966, Dunod, Paris, 1967. [Zbl: 0207.50901]
  • J. K. HARTMAN et L. S. LASDON, A generalized upper bounding algorithm for multicommodity network flow problems, Networks, 1, n° 4, 1971, p. 333-354. [MR: 311299] [Zbl: 0253.90030]
  • T. C. HU, Multicommodity network flows, J. Orsa, 11 (3) , 1963, p. 344-360. [Zbl: 0123.23704]
  • L. R. FORD et D. R. FULKERSON, Flows in networks, Princeton University Press, Princeton, 1962. [MR: 159700] [Zbl: 0106.34802]

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.