메뉴 건너뛰기
4OR
Volumn 3, Issue 1, 2005, Pages 23-37
A decomposition approach for a very large scale optimal diversity management problem
Author keywords

Lagrangian heuristic; Optimal diversity management problem; P median
Indexed keywords

EID: 18844374819     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-004-0059-1     Document Type: Article
Times cited : (18)
References (10)
  • 1
    • 33749629017 scopus 로고    scopus 로고
    • Computational study of large-scale p-Median problems
    • DIS - Universita di Roma "La Sapienza"
    • Avella P, Sassano A, Vasil'ev I (2003) Computational study of large-scale p-Median problems. Technical Reprt 08-03, DIS - Universita di Roma "La Sapienza"
    • (2003) Technical Reprt , vol.8 , Issue.3
    • Avella, P.1    Sassano, A.2    Vasil'ev, I.3
  • 2
    • 0033464965 scopus 로고    scopus 로고
    • Logical reduction tests for the p-median problem
    • Avella P, Sforza A (1999) Logical reduction tests for the p-median problem. Annals of Operations Research 86: 105-115
    • (1999) Annals of Operations Research , vol.86 , pp. 105-115
    • Avella, P.1    Sforza, A.2
  • 3
    • 0027557167 scopus 로고
    • Lagrangean heuristics for location problems
    • Beasley JE (1983) Lagrangean heuristics for location problems. EJOR 65: 383-399
    • (1983) EJOR , vol.65 , pp. 383-399
    • Beasley, J.E.1
  • 4
    • 19444366732 scopus 로고    scopus 로고
    • The optimal diversity management problem
    • Briant O, Naddef D (2004) The optimal diversity management problem. Operations Research 52(4): 515-526
    • (2004) Operations Research , vol.52 , Issue.4 , pp. 515-526
    • Briant, O.1    Naddef, D.2
  • 5
    • 0017477973 scopus 로고
    • Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
    • Cornuejols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float : An analytic study of exact and approximate algorithms. Management Science 23: 789-810
    • (1977) Management Science , vol.23 , pp. 789-810
    • Cornuejols, G.1    Fisher, M.L.2    Nemhauser, G.L.3
  • 7
    • 0018678438 scopus 로고
    • An algorithmic approach to network location problems. II: The p-medians
    • Kariv O, Hakimi L (1979) An algorithmic approach to network location problems. II: the p-medians. Operations Research 37(3): 539-560
    • (1979) Operations Research , vol.37 , Issue.3 , pp. 539-560
    • Kariv, O.1    Hakimi, L.2
  • 8
    • 2142727654 scopus 로고    scopus 로고
    • A GRASP with path-relinking for the p-median problem
    • AT&T Labs
    • Resende MGC, Werneck RF (2002a) A GRASP with path-relinking for the p-median problem. Technical Report TD-5E53XL, AT&T Labs
    • (2002) Technical Report , vol.TD-5E53XL
    • Resende, M.G.C.1    Werneck, R.F.2
  • 9
    • 0037533144 scopus 로고    scopus 로고
    • On the implementation of a swap-based local search procedure for the p-median problem
    • AT&T Labs
    • Resende MGC, Werneck RF (2002b) On the implementation of a swap-based local search procedure for the p-median problem. Technical Report TD-5E4QKA, AT&T Labs
    • (2002) Technical Report , vol.TD-5E4QKA
    • Resende, M.G.C.1    Werneck, R.F.2
  • 10
    • 0020747698 scopus 로고
    • A fast algorithm for the greedy interchange for large-scale clustering and median location problems
    • Whitaker RA (1983) A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFORS 21: 95-108
    • (1983) INFORS , vol.21 , pp. 95-108
    • Whitaker, R.A.1

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