COMBINATORIAL APPROACHES TO MULTIFLOW PROBLEMS.

Discrete Applied Mathematics

Volumn 11, Issue 1, 1985, Pages 1-93

  Lomonosov, Michael V ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS;

MULTICOMMODITY NETWORK FLOWS;

MATHEMATICAL PROGRAMMING;

EID: 0022060704     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(85)90004-6     Document Type: Editorial

References (19)

1. L.R. Ford D.R. Fulkerson Flows in Networks 1962 Princeton Univ. Press Princeton, NJ
2. T.C. Hu Integer Programming and Network Flows 1970 Addison-Wesley Reading, MA
3. B.V. Cherkasski Solution for a problem on multicommodity network flows Ekonomika i Matem. Metody 13 1 1977 143 151 (Russian)
4. B.V. Cherkasski On multiterminal multicommodity flow problems Isslo dovaniya po Diskretnoy Optimizacii 1976 Nauka Moscow 261 286 (Russian)
5. G.M. Adelson-Velski E.A. Dinic A.V. Karzanov Algorithms for Flows in Networks 1975 Nauka Moscow (Russian)
6. K. Onaga O. Kakusho On feasibility conditions of multicommodity flows in networks IEEE Trans. Circuit Theory 18 4 1971 425 429
7. M. Iri On an extension of the maximum-flow minimum-cut theorem to multicommodity flows J. Oper. Res. Soc. Japan 13 1971 129 135
8. B.A. Papernov, On existence of multicommodity flows, in: “Issledovaniya po Discretnoy Optimizacii” (Moscow, “Nauka”) 230–261 (Russian).
9. A.A. Assad Multicommodity network flows — A survey Networks 8 1 1978 37 91
10. M.V. Lomonosov On flows in networks Problemy Peredatchi Informacii 14 4 1978 60 73 (Russian)
11. M.V. Lomonosov, Solutions for two problems on flows in networks, to appear (submitted to the same journal in July 1976, Russian).
12. A.V. Karzanov Combinatorial techniques for cut-dependent multiflow problems Collected papers, Issue 3 Combinatorial Methods in Flow Problems 1979 The Institute for Systems Studies Moscow 6 70 (Russian)
13. A.V. Karzanov P.A. Poevzner Characterization of the class of non-cut-dependent multiflow optimization problems Combinatorial Methods in Flow Problems 1979 The Institute for Systems Studies Moscow 70 81 (Russian)
14. A.V. Karzanov Time saving techniques for solving two known multiflow problems in undirected networks Combinatorial Methods in Flow Problems 1979 The Institute for Systems Studies Moscow 96 103 (Russian)
15. A.V. Karzanov On the cost minimization problem for maximal multiflows Combinatorial Methods in Flow Problems 1979 The Institute for Systems Studies Moscow 138 156 (Russian)
16. A.V. Dinic A.E. Karzanov On the existence of two integer-valued flows of unit magnitude Combinatorial Methods in Flow Problems 1979 The Institute for Systems Studies Moscow 127 137 (Russian)
17. V.L. Kuperschtoch On a generalization of the Ford-Fulkerson Theorem to multiterminal networks Kiev Kybernetika 3 1971 (Russian)
18. D. Avis Extremal metrics induced by graphs Annals Discrete Math. 8 1980 North-Holland Amsterdam 217 220
19. D. Avis On the extreme rays of the metric cone Canad. J. Math. 32 1 1980 126 144