An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[3] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .
[4] Graciano Sá,et al. Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..
[5] P. Gray,et al. Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration Constraints , 1971 .
[6] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .
[7] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[8] John J. H. Forrest,et al. Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .