A simple dual ascent algorithm for the multilevel facility location problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 55-63

  Bumb, Adriana ^a   Kern, Walter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LOCATION; OPTIMIZATION; RANDOM PROCESSES;

ASCENT ALGORITHMS; FACILITY LOCATION PROBLEM; PRIMAL-DUAL;

APPROXIMATION ALGORITHMS;

EID: 84923106008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (7)

1. Aardal, K.I., Chudak, F., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters, 72, (1999), 161–167
2. Cornuejols, G., Nemhauser, G. L., Wolsey, L. A.: The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, John Wiley and Sons, New York, (1990), 119–171
3. Guha, S., Khuller, S.: Greedy strikes back: improved facility algorithms. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, (1998), 649–657
4. Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k−median problems. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, (1999)
5. Meyerson, A., Munagala, K., Plotkin S.: Cost distance: Two metric network design. Proceedings of the 41th IEEE Symposium on Foundation of Computer Science, (2000)
6. Shmoys, D. B., Tardos, E. Aardal, K. I.: Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, (1997), 265–274
7. Sviridenko, M.: Personal communication, (1997)