Multilocation plant sizing and timing: a study of some decomposition procedures
暂无分享,去创建一个
[1] Thomas L. Magnanti,et al. Applied Mathematical Programming , 1977 .
[2] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[3] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[4] Donald Erlenkotter,et al. Capacity Planning for Large Multilocation Systems: Approximate and Incomplete Dynamic Programming Approaches , 1975 .
[5] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[6] Alan S. Manne,et al. Investments for Capacity Expansion. Size, Location, and Time-Phasing. Edited by A.S. Manne. Studies in the Economic Development of India, n° 5. London, G. Allen & Unwin Ltd., 1967, 239 p., 45/-. , 1967, Recherches économiques de Louvain.
[7] David Mautner Himmelblau,et al. Decomposition of large-scale problems , 1973 .
[8] Wjm Walter Kickert. Organisation of decision-making : a systems-theoretical approach , 1979 .
[9] Ram C. Rao,et al. Multilocation Plant Sizing and Timing , 1977 .
[10] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[11] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .