Approximation algorithms for problems combining facility location and network design

Operations Research

Volumn 54, Issue 1, 2006, Pages 73-81

  Ravi, R ^a   Sinha, Amitabh ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Facilities: Location, discrete; Networks graphs: Flow algorithms; Transportation: Models, networks

Indexed keywords

APPROXIMATION ALGORITHMS; FACILITIES: LOCATION, DISCRETE; NETWORKS/GRAPHS: FLOW ALGORITHMS; TRANSPORTATION: MODELS, NETWORKS;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; NETWORK PROTOCOLS; PROBLEM SOLVING;

ALGORITHMS;

EID: 33644508921     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1050.0228     Document Type: Article

References (22)

1. Agrawal, A., P. Klein, R. Ravi. 1995. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24 440-456.
2. Arya, V., N. Garg, R. Khandekar, V. Pandit, A. Meyerson, K. Munagala. 2001. Local search heuristic for k-median and facility location problems. Proc. 33rd ACM Sympos. on the Theory of Comput., Crete, Greece, 21-29.
3. Balinski, M. L. 1966. On finding integer solutions to linear programs. Proc. IBM Scientific Comput. Sympos. on Combin. Problems, 225-248.
4. Charikar, M., S. Guha, D. Shmoys, E. Tardos. 1999. A constant-factor approximation algorithm for the k-median problem. Proc. 31st ACM Sympos. on Theory of Comput., Atlanta, GA, 1-10.
5. Cornuejols, G., G. Nemhauser, L. Wolsey. 1990. The uncapacitated facility location problem. P. Mirchandani, R. Francis, eds. Discrete Location Theory. Wiley, New York, 119-171.
6. Goel, A., D. Estrin. 2003. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. Proc. 14th ACM-SIAM Sympos. on Discrete Algorithms, Baltimore, MD, 499-505.
7. Goemans, M. X., D. P. Williamson. 1995. A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2) 296-317.
8. Guha, S., A. Meyerson, K. Munagala. 2001. Improved combinatorial algorithms for single sink edge installation problems. Proc. 33rd ACM Sympos. on the Theory of Comput., Crete, Greece, 383-388.
9. Gupta, A., A. Kumar, T. Roughgarden. 2003. Simpler and better approximation algorithms for network design. Proc. 35th ACM Sympos. on the Theory of Comput., San Diego, CA, 365-372.
10. Haresamudra, B., G. D. Taylor, H. A. Taha. 1995. An interactive approach to locate breakbulk terminals for LTL trucking operations. Final research report MBTC-FR-1037, Mack-Blackwell Transportation Center, University of Arkansas, Fayetteville, AR.
11. Hassin, R., R. Ravi, F. S. Salman. 2000. Approximation algorithms for a capacitated network design problem. Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 1913. Springer, Germany, 167-176.
12. Jain, K., V. V. Vazirani. 1999. Primal-dual approximation algorithms for metric facility location and k-median problems. Proc. 40th Ann. IEEE Sympos. on Foundations of Comput. Sci., New York, 2-13.
13. Jain, K., M. Mahdian, A. Saberi. 2002. A new greedy approach for facility location problems. Proc. 34th ACM Sympos. on the Theory of Comput., Montreal, Quebec, Canada, 731-740.
14. Korupulu, M., C. Plaxton, R. Rajaraman.1998. Analysis of a local search heuristic for facility location problems. Proc. 9th ACM-SIAM Sympos. on Discrete Algorithms, San Francisco, CA, 1-10.
15. Mahdian, M., Y. Ye, J. Zhang. 2002. A 1.52 approximation algorithm for the uncapacitated facility location problem. Approximation Algorithms for Combinatorial Optimization, Springer, Germany, 229-242.
16. Mansour, Y., D. Peleg. 1994. An approximation algorithm for minimum-cost network design. Technical report CS94-22, The Weizman Institute of Science, Rehovot, Israel.
17. Meyerson, A., K. Munagala, S. Plotkin. 2000. Cost-distance: Two metric network design. Proc. 41st Ann. IEEE Sympos. on Foundations of Comput. Sci., Redondo Beach, CA, 624-630.
18. Min, H., J. R. Current, D. A. Schilling. 1992. The multiple depot vehicle routing problem with backhauling. J. Bus. Logist. 13 259-288.
19. Ravi, R. 1994. A primal-dual approximation algorithm for the Steiner forest problem. Inform. Processing Lett. 50(4) 185-190.
20. Robins, G., A. Zelikovsky. 1999. Improved Steiner tree approximation in graphs. Proc. 10th ACM-SIAM Sympos. on Discrete Algorithms, Baltimore, MD, 770-779.
21. Salman, F. S., J. Cheriyan, R. Ravi, S. Subramanian. 2000. Buy-at-bulk network design: Approximating the single-sink edge installation problem. SIAM J. Optim. 11(3) 595-610.
22. Shmoys, D., E. Tardos, K. Aardal. 1997. Approximation algorithms for the facility location problem. Proc. 29th ACM Sympos. on the Theory of Comput., El Paso, TX, 265-274.