메뉴 건너뛰기




Volumn 122, Issue 1-4, 2003, Pages 141-161

A Lagrangean Heuristic for a Modular Capacitated Location Problem

Author keywords

Capacitated location; Lagrangean heuristic; Mixed integer linear programming

Indexed keywords


EID: 0345865107     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1026146507143     Document Type: Article
Times cited : (60)

References (20)
  • 1
    • 0032186917 scopus 로고    scopus 로고
    • Lagrangean Heuristics Applied to a Variety of Large Capacitated Plant Location Problem
    • Agar, M. and S. Salhi. (1998). "Lagrangean Heuristics Applied to a Variety of Large Capacitated Plant Location Problem." Journal of the Operational Research Society 49, 1072-1084.
    • (1998) Journal of the Operational Research Society , vol.49 , pp. 1072-1084
    • Agar, M.1    Salhi, S.2
  • 3
    • 0023963030 scopus 로고
    • An Algorithm for Solving Large Capacitated Warehouse Location Problems
    • Beasley, J. (1988). "An Algorithm for Solving Large Capacitated Warehouse Location Problems." European Journal of Operational Research 33, 314-325.
    • (1988) European Journal of Operational Research , vol.33 , pp. 314-325
    • Beasley, J.1
  • 6
    • 0026106418 scopus 로고
    • A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem
    • Cornuejols, G., R. Sridharan, and J. Thizy. (1991). "A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem." European Journal of Operational Research 50, 280-297.
    • (1991) European Journal of Operational Research , vol.50 , pp. 280-297
    • Cornuejols, G.1    Sridharan, R.2    Thizy, J.3
  • 9
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest Path
    • Floyd, R. (1962). "Algorithm 97: Shortest Path." Communications of the ACM 5, 345.
    • (1962) Communications of the ACM , vol.5 , pp. 345
    • Floyd, R.1
  • 10
    • 0002554041 scopus 로고
    • Lagrangean Relaxation for Integer Programming
    • Geoffrion, A. (1974). "Lagrangean Relaxation for Integer Programming." Mathematical Programming Study 2, 82-114.
    • (1974) Mathematical Programming Study , vol.2 , pp. 82-114
    • Geoffrion, A.1
  • 13
    • 0028427654 scopus 로고
    • Solving the Staircase Cost Facility Location Problem with Decomposition and Piecewise Linearization
    • Holmberg, K. (1994). "Solving the Staircase Cost Facility Location Problem with Decomposition and Piecewise Linearization." European Journal of Operational Research 75, 41-61.
    • (1994) European Journal of Operational Research , vol.75 , pp. 41-61
    • Holmberg, K.1
  • 14
    • 0031076353 scopus 로고    scopus 로고
    • A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs
    • Holmberg, K. and J. Ling. (1997). "A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs." European Journal of Operational Research 97, 63-74.
    • (1997) European Journal of Operational Research , vol.97 , pp. 63-74
    • Holmberg, K.1    Ling, J.2
  • 15
    • 0025742077 scopus 로고
    • An Optimal Algorithm for the Multiproduct Capacitated Facility Location Problem with a Choice of Facility Type
    • Lee, C. (1991). "An Optimal Algorithm for the Multiproduct Capacitated Facility Location Problem with a Choice of Facility Type." Computers and Operations Research 18, 167-182.
    • (1991) Computers and Operations Research , vol.18 , pp. 167-182
    • Lee, C.1
  • 16
    • 0348177875 scopus 로고    scopus 로고
    • An Algorithm for a Two-Staged Distribution System with Various Types of Distribution Centers
    • Lee, C. (1996). "An Algorithm for a Two-Staged Distribution System with Various Types of Distribution Centers." Infor 34, 105-117.
    • (1996) Infor , vol.34 , pp. 105-117
    • Lee, C.1
  • 19
    • 0026185568 scopus 로고
    • A Lagrangean Heuristic for the Capacitated Plant Location Problem with Side Constraints
    • Sridharan, R. (1991). "A Lagrangean Heuristic for the Capacitated Plant Location Problem with Side Constraints." Journal of the Operational Research Society 42, 579-585.
    • (1991) Journal of the Operational Research Society , vol.42 , pp. 579-585
    • Sridharan, R.1
  • 20
    • 0022874081 scopus 로고
    • A Cross Decomposition Procedure for the Facility Location Problem with a Choice of Facility Type
    • Yoo, C. and D. Tcha. (1986). "A Cross Decomposition Procedure for the Facility Location Problem with a Choice of Facility Type." Computers and Industrial Engineering 10, 3-290.
    • (1986) Computers and Industrial Engineering , vol.10 , pp. 3-290
    • Yoo, C.1    Tcha, D.2


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