메뉴 건너뛰기




Volumn 177, Issue 2, 2006, Pages 803-812

Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort

Author keywords

Distribution; Location; Transportation

Indexed keywords

COMPUTATIONAL METHODS; LOCATION; TRANSPORTATION; WAREHOUSES;

EID: 33750449636     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.11.028     Document Type: Article
Times cited : (31)

References (25)
  • 1
    • 0017454118 scopus 로고
    • An efficient branch and bound algorithm for the capacitated warehouse location problem
    • Akinc U., and Khumawala M. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science 23 6 (1977) 585-594
    • (1977) Management Science , vol.23 , Issue.6 , pp. 585-594
    • Akinc, U.1    Khumawala, M.2
  • 3
    • 0017477973 scopus 로고
    • Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
    • Cornuejols G., Fisher M.L., and Nemhauser G.L. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23 (1977) 789-810
    • (1977) Management Science , vol.23 , pp. 789-810
    • Cornuejols, G.1    Fisher, M.L.2    Nemhauser, G.L.3
  • 4
    • 0026106418 scopus 로고
    • A comparison of heuristics and relaxations for the capacitated plant location problem
    • Cornuejols G., Sridharan R., and Thizy J.M. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50 (1991) 280-287
    • (1991) European Journal of Operational Research , vol.50 , pp. 280-287
    • Cornuejols, G.1    Sridharan, R.2    Thizy, J.M.3
  • 5
    • 0000362228 scopus 로고
    • A branch and bound algorithm for the capacitated facility location problem
    • Davis P.R., and Ray T.L. A branch and bound algorithm for the capacitated facility location problem. Naval Research Logistic Quarterly 16 (1969) 47-60
    • (1969) Naval Research Logistic Quarterly , vol.16 , pp. 47-60
    • Davis, P.R.1    Ray, T.L.2
  • 6
    • 0022101579 scopus 로고
    • ADD heuristics' starting procedures for capacitated plant location models
    • Domschke W., and Drexl A. ADD heuristics' starting procedures for capacitated plant location models. European Journal of Operational Research 21 (1985) 47-53
    • (1985) European Journal of Operational Research , vol.21 , pp. 47-53
    • Domschke, W.1    Drexl, A.2
  • 7
    • 0015204970 scopus 로고
    • Solving fixed charge location-allocation problem with capacity and configuration constraints
    • Ellwein L.B., and Gray P. Solving fixed charge location-allocation problem with capacity and configuration constraints. AIIE Transactions 3 4 (1971) 290-298
    • (1971) AIIE Transactions , vol.3 , Issue.4 , pp. 290-298
    • Ellwein, L.B.1    Gray, P.2
  • 8
    • 0018031445 scopus 로고
    • A dual-based procedure for uncapacitated facility location
    • Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research 26 (1978) 992-1009
    • (1978) Operations Research , vol.26 , pp. 992-1009
    • Erlenkotter, D.1
  • 9
    • 0000809110 scopus 로고
    • Warehouse location under continuous economies of scales
    • Feldman E., Lehrer F.A., and Ray T.L. Warehouse location under continuous economies of scales. Management Science 2 (1966) 123-135
    • (1966) Management Science , Issue.2 , pp. 123-135
    • Feldman, E.1    Lehrer, F.A.2    Ray, T.L.3
  • 10
    • 0008683322 scopus 로고
    • Worst case analysis of heuristic algorithms
    • Fisher M.L. Worst case analysis of heuristic algorithms. Management Science 1 (1980) 1-17
    • (1980) Management Science , vol.1 , pp. 1-17
    • Fisher, M.L.1
  • 11
    • 0343935376 scopus 로고
    • Location theory: A selective bibliography
    • Francis R.L., and Goldstein J.M. Location theory: A selective bibliography. Operations Research 22 (1974) 400-410
    • (1974) Operations Research , vol.22 , pp. 400-410
    • Francis, R.L.1    Goldstein, J.M.2
  • 12
    • 0017942883 scopus 로고
    • Lagrangian relaxation applied to capacitated facility location problems
    • Geoffrion A.M., and McBride R. Lagrangian relaxation applied to capacitated facility location problems. AIIE Transactions 10 (1978) 40-47
    • (1978) AIIE Transactions , vol.10 , pp. 40-47
    • Geoffrion, A.M.1    McBride, R.2
  • 13
    • 0002554041 scopus 로고
    • Multicommodity distribution system design by Benders decomposition
    • Geoffrion A.M., and Graves G.W. Multicommodity distribution system design by Benders decomposition. Management Science 2 (1974) 82-114
    • (1974) Management Science , vol.2 , pp. 82-114
    • Geoffrion, A.M.1    Graves, G.W.2
  • 14
  • 15
    • 0016351467 scopus 로고
    • An efficient heuristic procedure for the capacitated warehouse location problem
    • Khumawallah B.M. An efficient heuristic procedure for the capacitated warehouse location problem. Naval Research Logistics Quarterly 21 4 (1974) 609-623
    • (1974) Naval Research Logistics Quarterly , vol.21 , Issue.4 , pp. 609-623
    • Khumawallah, B.M.1
  • 16
    • 0000369468 scopus 로고
    • Heuristic program for locating warehouse
    • Kuehn A.A., and Hamburger M.J. Heuristic program for locating warehouse. Management Science 9 July (1963) 643-666
    • (1963) Management Science , vol.9 , Issue.July , pp. 643-666
    • Kuehn, A.A.1    Hamburger, M.J.2
  • 18
    • 0018056041 scopus 로고
    • An improved algorithm for capacitated plant location problem
    • Nauss R.M. An improved algorithm for capacitated plant location problem. Journal of Operational Research Society 29 (1978) 1195-1201
    • (1978) Journal of Operational Research Society , vol.29 , pp. 1195-1201
    • Nauss, R.M.1
  • 19
    • 33750490490 scopus 로고    scopus 로고
    • R. Sridharan, Capacitated Plant Location Problem, Unpublished Ph.D. dissertation, Carnegie Mellon University, 1986.
  • 20
    • 0014597338 scopus 로고
    • Branch and bound and approximate solutions to the capacitated plant location problem
    • Sa G. Branch and bound and approximate solutions to the capacitated plant location problem. Operations Research November-December (1969) 1005-1016
    • (1969) Operations Research , Issue.November-December , pp. 1005-1016
    • Sa, G.1
  • 21
    • 0004183273 scopus 로고
    • Addison-Wesley Publishing House, Reading, MA
    • Salkin H.M. Integer Programming (1975), Addison-Wesley Publishing House, Reading, MA
    • (1975) Integer Programming
    • Salkin, H.M.1
  • 23
    • 33750452386 scopus 로고    scopus 로고
    • Foodgrains distribution in the Indian context: An operational study
    • Tripathy A., and Rosenhead J. (Eds), New Age International Publishers, New Delhi
    • Sharma R.R.K. Foodgrains distribution in the Indian context: An operational study. In: Tripathy A., and Rosenhead J. (Eds). Operations Research for Development, Ahmedabad, India (1996), New Age International Publishers, New Delhi 212-227
    • (1996) Operations Research for Development, Ahmedabad, India , pp. 212-227
    • Sharma, R.R.K.1
  • 25
    • 0022613611 scopus 로고
    • A cross decomposition algorithm for capacitated facility location
    • Van Roy T.J. A cross decomposition algorithm for capacitated facility location. Operations Research 34 (1986) 145-163
    • (1986) Operations Research , vol.34 , pp. 145-163
    • Van Roy, T.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.