1 |
Hong, S. H. and Lee, Y.H. (2004). The Maximal Covering Location Problem with Cost Restrictions. Journal of the Korean Institute of Industrial Engineers, 30, 93-106
|
2 |
Barcelo, J. and Casanovas, J. (1984). A heuristic lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 15, 212-226
DOI
ScienceOn
|
3 |
Brandeau, M. L. and Chiu, S. S. (1989). Anoverview of representative problems in location research. Management Science, 35, 645-674
DOI
ScienceOn
|
4 |
Captivo, M. E. (1991). Fast primal and dual heuristic for the p-median location problem. European Journal of Operational Research, 52, 65-74
DOI
ScienceOn
|
5 |
Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research, 26, 992-1009
DOI
ScienceOn
|
6 |
Geoffrion, A. M. and McBride, R. (1978). Lagrangian relaxation applied to capacitated facility location problems. AIlE Transactions, 10, 40-47
DOI
ScienceOn
|
7 |
Ghosh, D. (2003). Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, 150, 150-162
DOI
ScienceOn
|
8 |
Kuen, A. A. and Hamburger, M. J. (1963). A Heuristic Program for Locating Warehouses. Management Science, 9, 643-666
DOI
ScienceOn
|
9 |
Sankaran, J. K. (2007). On solving large instances of the capacitated facility location problem. European Journal of Operational Research, 178, 663-676
DOI
ScienceOn
|
10 |
Sun, M. (2006). Solving the uncapacitated facility location problem using tabu search. Computers and Operational Research, 33, 2563-2589
DOI
ScienceOn
|
11 |
Wang, Q., Batta, R., Bhadury, J., and Rump, C. M. (2003). Budget constrained location problem with opening and closing of facilities. Computers and Operational Research, 30, 2047-2069
DOI
ScienceOn
|
12 |
Webb, M. H. J. (1968). Cost Functions in the Location of Depots for Multi-Delivery journeys. Opnl. Res. Q., 19. 311-328
DOI
|
13 |
Yang, B. H. (1999). A study on Location-Allocation Problem with the Cost of Land. Journal of Military Operations Research Society Of Korea, 25, 117-129
|
14 |
Megiddo, N., Zemel, E., and Hakimi, S. L. (1983). The Maximum Coverage Location Problem, SIAM journal on Algebraic and Discrete Methods, 4, 253-261
DOI
|
15 |
Akinc, U. and Khumawala, B. M. (1977). An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem. Management Science, 23, 585-594
DOI
ScienceOn
|
16 |
Jin, H. W. (2006). A study on the Budget Constrained Facility Location Problem. Journal Business Research, 21, 263-283
|
17 |
Ndiaye, M. and Alfares, H. (2006). Modeling health care facility location for moving population groups. Computers and Operation Research, In Press, Corrected Proof, Available online 27 October 2006
|
18 |
Kang, I. S. (1984). An heuristic algorithm for the location-routing problem. Journal of the Korean Institute of Industrial Engineers, 10, 45-50
|
19 |
Dobson, G. and Karmarkar, U. S. (1987). Competitive Location on a Network. Operations Research, 35, 467-486
|
20 |
Kim, E. J., Kang, D. H., Lee, K. S., and Park, S. S. (2003). An Optimization Algorithm for the Two-Echelon Capacitated Facility Location Problem. Journal of the Korean Institute of Industrial Engineers, 2003, 137-144
|
21 |
Cho, G. (2006). A study on developing an integrated Model of facility location problems and safety stock optimization problems in supply chain management. International Journal of Management Science, 31, 91-103
|
22 |
Hinojosa, Y., Puerto, J., and Fernandez, F. R. (2000). A multiperiod two-echelon multicommodity capacitated plant location problem. European Journal of Operational Research, 123, 271-291
DOI
ScienceOn
|
23 |
Neebe, A. E. and Rao, M. R. (1983). An algorithm for the fixed charge assigning users to sources problem. Journal of the Operational Research Society, 34, 1107-1113
DOI
ScienceOn
|
24 |
Van Roy, T. J. and Erlenkotter, D. (1982). A dual-based procedure dynamic facility location. Management Science, 28, 1091-1105
DOI
ScienceOn
|
25 |
Al-sultan, K. S. and AI-Fawzan, M. A. (1999). A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86, 91-103
DOI
ScienceOn
|
26 |
Gamal, M.D. H.and Salhi, S. (2001). Constructive heuristics for the uncapacitated continuous location-allocation problem. Journal of the Operational Research Society, 52, 821-829
DOI
ScienceOn
|
27 |
Barreto, S., Ferreira, C., Paixao, J., and Santos, B. S, (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179, 968-977
DOI
ScienceOn
|
28 |
Bektas, T. (2006). Capacitated facility location : Separation algorithms and computational experience, Mathematical Programming, 81, 149-175
|
29 |
Wu, L. Y., Zhang, X. S., and Zhang, J.L. (2006). Capacitated facility location problem with general setup cost. Computers and Operational Research, 33, 1226-1241
DOI
ScienceOn
|
30 |
Lee, Y. H., Jong, B. J., and Park, K. T. (2002). Supply Chain Management : Strategy, Planning and Operation, book concern Sukjung
|
31 |
Melkote, S. and Daskin, M. S. (2001). Capacitated facility location / network design problems. European Journal of Operational Research, 129, 481-495
DOI
ScienceOn
|