A multiexchange local search algorithm for the capacitated facility location problem

Mathematics of Operations Research

Volumn 30, Issue 2, 2005, Pages 389-403

  Zhang, Jiawei ^a   Chen, Bo ^b   Ye, Yinyu ^c  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c Stanford University   (United States)

Author keywords

Approximation algorithm; Capacitated facility location; Local search algorithm

Indexed keywords

APPROXIMATION ALGORITHM; CAPACITATED LOCATION FACILITY; LOCAL SEARCH ALGORITHM;

APPROXIMATION THEORY; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

ALGORITHMS;

EID: 31144452012     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1040.0125     Document Type: Review

References (20)

1. Aardal, K., F. A. Chudak, D. B. Shmoys. 1999. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inform. Processing Lett. 72 161-167.
2. Ageev, A., Y. Ye, J. Zhang. 2004. Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J. Discrete Math. 18(1) 207-217.
3. Arya, V., N. Garg, R. Khandekar, A. Meyerson, K. Munagala, V. Pandit. 2001. Local search heuristic for k-median and facility location problems. Proc. ACM Sympos. Theory Comput. (STOC), 21-29.
4. Charikar, M., S. Khuller, D. M. Mount, G. Narasimhan. 2001. Algorithms for facility location problems with outliers. Proc. 12th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), 642-651.
5. Chudak, F. A., D. B. Shmoys. 2003. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1) 1-25.
6. Chudak, F. A., D. P. Williamson. 1999. Improved approximation algorithms for capacitated facility location problems. Proc. 7th Conf. Integer Programming Combin. Optim. (IPCO), 99-113.
7. Guha, S., S. Khuller. 1999. Greedy strikes back: Improved facility location algorithms. J. Algorithms 31 228-248.
8. Guha, S., A. Meyerson, K. Munagala. 2001. Improved algorithms for fault tolerant facility location. Proc. 12th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), 636-641.
9. Khuller, S., Y. J. Sussmann. 2000. The capacitated k-center problem. SIAM J. Discrete Math. 13 403-418.
10. Korupolu, M. R., C. G. Plaxton, R. Rajaraman. 1998. Analysis of a local search heuristic for facility location problems. Proc. 9th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), 1-10.
11. Kuehn, A. A., M. J. Hamburger. 1963. A heuristic program for locating warehouses. Management Sci. 9 643-666.
12. Mahdian, M., M. Pál. 2003. Universal facility location. Proc. 11th Annual Eur. Sympos. Algorithms (ESA), 409-421.
13. Mahdian, M., Y. Ye, J. Zhang. 2002. Improved approximation algorithms for metric facility location problems. K. Jansen, S. Leonardi, V. Vazirani, eds. Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Computer Science, No. 2462. Springer, Berlin, Germany, 229-242.
14. Mahdian, M., Y. Ye, J. Zhang. 2003. A 2-approximation algorithm for the soft-capacitated facility location problem. S. Arora, K. Jansen, Jose D. P. Rolim, Amit Sahai, eds., Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Computer Science, No. 2764. Springer, Berlin, Germany, 129-140.
15. Pál, M., É. Tardos, T. Wexler. 2001. Facility location with hard capacities. Proc. 42nd IEEE Sympos. Foundations Comput. Sci. (FOCS), 329-338.
16. Shmoys, D. B. 2000. Approximation algorithms for facility location problems. Proc. 3rd Internat. Workshop Approximation Algorithms Combin. Optim. (APPROX), 27-33.
17. Shmoys, D. B., É. Tardos, K. I. Aardal. 1997. Approximation algorithms for facility location problems. Proc. 29th Annual ACM Sympos. Theory Comput. (STOC), 265-274.
18. Swamy, C., D. B. Shmoys. 2003. Fault-tolerant facility location. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), 735-736.
19. Zhang, J. 2004. Approximating the two-level facility location problem via a quasi-greedy approach. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), 801-810.
20. Zhang, J., B. Chen, Y. Ye. 2004. A multi-exchange local search algorithm for the capacitated facility location problem. D. Bienstock, G. Nemhauser, eds., Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, No. 3064. Springer, Berlin, Germany, 219-233.