Combinatorial algorithms for the generalized circulation problem

A generalization of the maximum-flow problem is considered in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e) lambda (e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exchange rates. Conservation of flow is required at every node except a given source node. The goal is to maximize the amount of flow excess at the source. This problem is a special case of linear programming, and therefore can be solved in polynomial time. The authors present polynomial-time combinatorial algorithms for this problem. The algorithms are simple and intuitive.<<ETX>>

[1]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[2]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[3]  K. Onaga.  Dynamic Programming of Optimum Flows in Lossy Communication Nets , 1966 .

[4]  T. L. Saaty,et al.  Finite graphs and networks : an introduction with applications , 1967 .

[5]  K. Onaga.  Optimum flows in general communication networks , 1967 .

[6]  John J. Jarvis,et al.  Maximal Flow with Gains through a Special Network , 1972, Oper. Res..

[7]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[8]  Fred W. Glover,et al.  On the equivalence of some generalized network problems to pure network problems , 1973, Math. Program..

[9]  K. Truemper.  On Max Flows with Gains and Pure Min-Cost Flows , 1977 .

[10]  Fred Glover,et al.  Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .

[11]  Fred W. Glover,et al.  A Strongly Convergent Primal Simplex Algorithm for Generalized Networks , 1979, Math. Oper. Res..

[12]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[13]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[14]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..

[15]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[16]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[17]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[18]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[19]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[20]  Pravin M. Vaidya,et al.  Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.

[21]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[22]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[23]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[24]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[25]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[26]  A. Goldberg,et al.  A new approach to the maximum-flow problem , 1988, JACM.

[27]  A. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

[28]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[29]  Éva Tardos,et al.  Using separation algorithms in fixed dimension , 1990, SODA '90.