Combinatorial Algorithms for the Generalized Circulation Problem
暂无分享,去创建一个
[1] Robert G. Busacker,et al. A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .
[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] Frank Harary,et al. Finite Graphs and Networks, An Introduction with Applications. , 1967 .
[7] John J. Jarvis,et al. Maximal Flow with Gains through a Special Network , 1972, Oper. Res..
[8] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[9] Fred W. Glover,et al. On the equivalence of some generalized network problems to pure network problems , 1973, Math. Program..
[10] K. Truemper. On Max Flows with Gains and Pure Min-Cost Flows , 1977 .
[11] Fred Glover,et al. Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .
[12] Fred W. Glover,et al. A Strongly Convergent Primal Simplex Algorithm for Generalized Networks , 1979, Math. Oper. Res..
[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] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[17] Michel Minoux,et al. Graphs and Algorithms , 1984 .
[18] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[19] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[20] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[21] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[22] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[23] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[24] Andrew Vladislav Goldberg,et al. Efficient graph algorithms for sequential and parallel computers , 1987 .
[25] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[26] Andrew V. Goldberg,et al. Combinatorial algorithms for the generalized circulation problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[27] Michael J. Todd,et al. Polynomial Algorithms for Linear Programming , 1988 .
[28] Andrew V. Goldberg,et al. Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.
[29] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[30] Éva Tardos,et al. Using separation algorithms in fixed dimension , 1990, SODA '90.
[31] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..