论文信息 - A branch-and-bound algorithm for the multi-level uncapacitated facility location problem - 字舞流文

A branch-and-bound algorithm for the multi-level uncapacitated facility location problem

D. Tcha | Bum-il Lee

[1] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .

[2] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[3] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[4] D. G. Elson. Site Location via Mixed-integer Programming , 1972 .

[5] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[6] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[7] A. M. FRIEZE. A cost function property for plant location problems , 1974, Math. Program..

[8] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[9] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[10] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[11] Pierre Hansen,et al. A Plant and Warehouse Location Problem , 1977 .

[12] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[13] Monique Guignard-Spielberg,et al. A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..