Improved Computer-Based Planning Techniques, Part 1
暂无分享,去创建一个
[1] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..
[2] A. Phillips. The macmillan company. , 1970, Analytical chemistry.
[3] Patrick Rivett,et al. Principles of Operations Research , 1972 .
[4] Jeffery L. Kennington,et al. Solving the Pipe Network Analysis Problem Using Optimization Techniques , 1978 .
[5] Darwin Klingman,et al. Augmented Threaded Index Method for Network Optimization. , 1974 .
[6] Roy L. Crum,et al. Implementation of Large-Scale Financial Planning Models: Solution Efficient Transformations , 1979 .
[7] Gerald L. Thompson,et al. Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems , 1972, JACM.
[8] Jeffery L. Kennington,et al. Primal simplex network codes: State-of-the-art implementation technology , 1978, Networks.
[9] Darwin Klingman,et al. The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .
[10] J. B. Lathrop,et al. Principles of operations research , 1954, Electrical Engineering.
[11] Darwin Klingman,et al. Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .
[12] Fred Glover,et al. Network Application in Industry and Government , 1977 .
[13] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[14] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .
[15] Fred Glover,et al. Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .