An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
暂无分享,去创建一个
[1] P. França,et al. Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition , 1982 .
[2] Tony J. Van Roy,et al. Cross decomposition for mixed integer programming , 1983, Math. Program..
[3] Barrie M. Baker,et al. Linear Relaxations of the Capacitated Warehouse Location Problem , 1982 .
[4] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[5] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .
[6] Hoang Hai Hoc,et al. Topological optimization of networks: A nonlinear mixed integer model employing generalized benders , 1980 .
[7] Donald R. Plane,et al. Discrete optimization : integer programming and network analysis for management decisions , 1971 .
[8] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[9] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[10] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[11] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[12] M. Laughton,et al. Large-scale mixed integer programming: Benders-type heuristics , 1984 .
[13] Barrie M. Baker. A partial dual algorithm for the capacitated warehouse location problem , 1986 .
[14] A. M. Geoffrion,et al. Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .
[15] Tony J. Van Roy,et al. A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..
[16] B. M. Khumawala. An efficient heuristic procedure for the uncapacitated warehouse location problem , 1973 .
[17] Søren Kruse Jacobsen,et al. Heuristics for the capacitated plant location model , 1983 .
[18] Robert M. Nauss,et al. An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .
[19] J. Barceló,et al. A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .
[20] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[21] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[22] Nicos Christofides,et al. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .
[23] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .
[24] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[25] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .
[26] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[27] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .
[28] Wolfgang Domschke,et al. ADD – heuristics' starting procedures for capacitated plant location models , 1985 .