On Multiroute Maximum Flows in Networks

Networks

Volumn 39, Issue 1, 2002, Pages 43-52

  Aggarwal, Charu C ^a   Orlin, James B ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Maximum flows; Multiroute flows; Network flows

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MULTIROUTE FLOWS;

NETWORKS (CIRCUITS);

EID: 0141763791     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10008     Document Type: Article

References (8)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. G. Birkhoff, Three observations on linear algebra, Rev Univ Nac Tucman A 5 (1946), 147-151.
3. A.V. Goldberg and S. Rao, Beyond the flow decomposition barrier, J ACM 45 (1998), 783-797.
4. W. Kishimoto, A method for obtaining the maximum multi-route flows in a network, Networks 27 (1996), 279-291.
5. W. Kishimoto and M. Takeuchi, On two-route flows in an undirected network, IEICE Technical Report, CAS90-19, DSP-90-23, 1990 (in Japanese).
6. W. Kishimoto and M. Takeuchi, On m-route flows in a network, IEICE Trans J-76-A (1993), 1185-1200.
7. W. Kishimoto, M. Takeuchi, and G. Kishi, Two-route flows in an undirected flow network, IEICE Trans J-75-A (1992), 1699-1717 (in Japanese).
8. U. Zimmerman, On the complexity of the dual method for maximum balanced flows, Discr Appl Math 50 (1994), 7788.