A branch‐bound algorithm for the capacitated facilities location problem
暂无分享,去创建一个
[1] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[2] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .
[3] G. Dantzig,et al. THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .
[4] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[5] A. Manne. Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .
[6] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .
[7] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[8] T. L. Ray,et al. Warehouse Location Under Continuous Economies of Scale , 1966 .