Site Location via Mixed-integer Programming
暂无分享,去创建一个
[1] Leon Cooper,et al. Heuristic Methods for Location-Allocation Problems , 1964 .
[2] T. L. Ray,et al. Warehouse Location Under Continuous Economies of Scale , 1966 .
[3] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[4] A. Manne. Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .
[5] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[6] P. J. Pengilly,et al. The Number and Location of Depots Required for Handling Products for Distribution to Retail Stores in South-East England , 1969 .
[7] W. Baumol,et al. A Warehouse-Location Problem , 1958 .
[8] F. E. Maranzana,et al. On the Location of Supply Points to Minimize Transport Costs , 1964 .
[9] Eilon,et al. Models for determining depot location , 1971 .
[10] Graciano Sá,et al. Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..
[11] Kurt Spielberg,et al. Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..
[12] Samuel Eilon,et al. Siting a Distribution Centre, An Analogue Computer Application , 1966 .
[13] P. Gray. Mixed integer programming algorithms for site selection and other fixed charge problems having capacity constraints , 1967 .
[14] Richard D. Smallwood,et al. Minimax Detection Station Placement , 1965 .
[15] Jane M. Hogg,et al. The Siting of Fire Stations , 1968 .
[16] D. H. Marks,et al. An Analysis of Private and Public Sector Location Models , 1970 .