The Minimum Cost Flow Problem and The Network Simplex Solution Method
暂无分享,去创建一个
[1] F. L. Hitchcock. The Distribution of a Product from Several Sources to Numerous Localities , 1941 .
[2] A. Orden. The Transhipment Problem , 1956 .
[3] G. Minty. Monotone networks , 1960, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.
[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[5] M. Klein. A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .
[6] L. Goddard,et al. Operations Research (OR) , 2007 .
[7] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[8] Gerald L. Thompson,et al. Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.
[9] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[10] A. Weintraub. A Primal Algorithm to Solve Network Flow Problems with Convex Costs , 1974 .
[11] Fred Glover,et al. A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .
[12] William H. Cunningham,et al. A network simplex method , 1976, Math. Program..
[13] A. Balaban. Chemical applications of graph theory , 1976 .
[14] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .
[15] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..
[16] Fred Glover,et al. Network Application in Industry and Government , 1977 .
[17] Richard V. Helgason,et al. An Efficient Procedure for Implementing a Dual Simplex Network Flow Algorithm , 1977 .
[18] Paul J. Schweitzer,et al. The zero pivot phenomenon in transportation and assignment problems and its computational implications , 1977, Math. Program..
[19] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[20] Donald Goldfarb,et al. A practicable steepest-edge simplex algorithm , 1977, Math. Program..
[21] John M. Mulvey,et al. Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.
[22] W. H. Cunningham,et al. Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..
[23] Robin Wilson,et al. Applications of graph theory , 1979 .
[24] P. V. Remoortere. Linear and combinatorial programming : K.G. Murty: 1976,J. Wiley, New York, 310 pp , 1979 .
[25] Vinod Chachra,et al. Applications of graph theory algorithms , 1979 .
[26] Ronald D. Armstrong,et al. Implementation and analysis of a variant of the dual method for the capacitated transshipment problem , 1980 .
[27] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[28] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[29] D. Bertsekas. Network Flows and Monotropic Optimization (R. T. Rockafellar) , 1985 .
[30] Dimitri P. Bertsekas,et al. A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..
[31] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .
[32] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..
[33] Dimitri P. Bertsekas,et al. Dual coordinate step methods for linear network flow problems , 1988, Math. Program..
[34] Michael Florian,et al. AN EFFICIENT IMPLEMENTATION OF THE NETWORK SIMPLEX METHOD. , 1997 .
[35] John Beidler,et al. Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.
[36] David Thomas,et al. The Art in Computer Programming , 2001 .