메뉴 건너뛰기




Volumn 10, Issue 1, 1998, Pages 87-102

A multiplier adjustment technique for the capacitated concentrator location problem

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING;

EID: 0032290930     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805703     Document Type: Article
Times cited : (3)

References (11)
  • 1
    • 0017454118 scopus 로고    scopus 로고
    • An efficient branch and bound algorithm for the capacitated warehouse location problem
    • February 1977
    • Akinc, U. and Khumawala, B. M. An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science, February 1977, 23(6), 585-594.
    • Management Science , vol.23 , Issue.6 , pp. 585-594
    • Akinc, U.1    Khumawala, B.M.2
  • 3
    • 84974872766 scopus 로고
    • Location problems arising in computer networks
    • Boffey, T. B. (1989). Location problems arising in computer networks. J. Operational Res. Society, 40(4), 347-354.
    • (1989) J. Operational Res. Society , vol.40 , Issue.4 , pp. 347-354
    • Boffey, T.B.1
  • 5
    • 0000354875 scopus 로고    scopus 로고
    • A multiplier adjustment method for the generalized assignment problem
    • September 1986
    • Fisher, M. L., Jaikumar, R. and Van Wassenhove, L. N. A multiplier adjustment method for the generalized assignment problem. Management Science, September 1986, 32(9), 1095-1103.
    • Management Science , vol.32 , Issue.9 , pp. 1095-1103
    • Fisher, M.L.1    Jaikumar, R.2    Van Wassenhove, L.N.3
  • 6
    • 0002554041 scopus 로고
    • Lagrangean relaxation and its uses in integer programming
    • Geoffrion, A. (1974). Lagrangean relaxation and its uses in integer programming. Math. Prog. Study, 2, 82-114.
    • (1974) Math. Prog. Study , vol.2 , pp. 82-114
    • Geoffrion, A.1
  • 7
    • 0024699993 scopus 로고
    • An improved dual-based algorithm for the generalized assignment problem
    • Guignard, M. and Rosenwein, M. (1989). An improved dual-based algorithm for the generalized assignment problem. Operations Research, 37(4), 658-663.
    • (1989) Operations Research , vol.37 , Issue.4 , pp. 658-663
    • Guignard, M.1    Rosenwein, M.2
  • 10
    • 0023246782 scopus 로고
    • Efficient algorithms for the capacitated concentrator location problem
    • Pirkul, H. (1987). Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 14(3), 197-208.
    • (1987) Computers and Operations Research , vol.14 , Issue.3 , pp. 197-208
    • Pirkul, H.1
  • 11
    • 0017552773 scopus 로고
    • Modeling facility location problems as generalized assignment problems
    • Ross, G. T. and Soland, R. M. (1977). Modeling facility location problems as generalized assignment problems. Management Science, 24(3), 345-357.
    • (1977) Management Science , vol.24 , Issue.3 , pp. 345-357
    • Ross, G.T.1    Soland, R.M.2


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