메뉴 건너뛰기




Volumn 3064, Issue , 2004, Pages 206-218

LP-based approximation algorithms for capacitated facility location

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33845962879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_16     Document Type: Article
Times cited : (39)

References (13)
  • 1
    • 0000894590 scopus 로고    scopus 로고
    • Capacitated facility location: Separation algorithms and computational experience
    • K. Aardal. Capacitated facility location: separation algorithms and computational experience. Mathematical Programming, 81:149-175, 1998.
    • (1998) Mathematical Programming , vol.81 , pp. 149-175
    • Aardal, K.1
  • 3
    • 84948955787 scopus 로고    scopus 로고
    • Improved approximation algorithms for capacitated facility location problems
    • G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, Graz, Springer
    • F. A. Chudak and D. P. Williamson. Improved approximation algorithms for capacitated facility location problems. In G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, volume 1610 of Lecture Notes in Computer Science, pages 99-113, Graz, 1999. Springer.
    • (1999) Lecture Notes in Computer Science , vol.1610 , pp. 99-113
    • Chudak, F.A.1    Williamson, D.P.2
  • 4
    • 0000682161 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
    • K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48:274-296, 2001.
    • (2001) Journal of the ACM , vol.48 , pp. 274-296
    • Jain, K.1    Vazirani, V.V.2
  • 5
    • 0038425786 scopus 로고    scopus 로고
    • Analysis of a local search heuristic for facility location problems
    • M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Journal of Algorithms, 37(1):146-188, 2000.
    • (2000) Journal of Algorithms , vol.37 , Issue.1 , pp. 146-188
    • Korupolu, M.R.1    Plaxton, C.G.2    Rajaraman, R.3
  • 7
    • 0022099739 scopus 로고
    • Valid linear inequalities for fixed charge problems
    • M. W. Padberg, T. J. Van Roy, and L. A. Wolsey. Valid linear inequalities for fixed charge problems. Operations Research, 33:842-861, 1985.
    • (1985) Operations Research , vol.33 , pp. 842-861
    • Padberg, M.W.1    Van Roy, T.J.2    Wolsey, L.A.3
  • 9
    • 84937441113 scopus 로고    scopus 로고
    • Approximation algorithms for facility location problems
    • D. B. Shmoys. Approximation algorithms for facility location problems. In Proceedings of 3rd APPROX, pages 27-33, 2000.
    • (2000) Proceedings of 3rd APPROX , pp. 27-33
    • Shmoys, D.B.1
  • 10
    • 0038309442 scopus 로고
    • An approximation algorithm for the generalized assignment problem
    • D. B. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461-474, 1993.
    • (1993) Mathematical Programming A , vol.62 , pp. 461-474
    • Shmoys, D.B.1    Tardos, É.2
  • 13
    • 35048840446 scopus 로고    scopus 로고
    • A multi-exchange local search algorithm for the capacitated facility location problem
    • Submitted
    • J. Zhang, B. Chen, and Y. Ye. A multi-exchange local search algorithm for the capacitated facility location problem. Submitted to Mathematics of Operations Research, 2003.
    • (2003) Mathematics of Operations Research
    • Zhang, J.1    Chen, B.2    Ye, Y.3


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