Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location

Authors:
Martin Hoefer
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany and TU Clausthal, Clausthal-Zellerfeld, Germany
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 10
Cited 3

Probabilistic analysis of a relaxation for the k-median problem

Mathematics of Operations Research
A method for solving to optimality uncapacitated location problems

Annals of Operations Research
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Analysis of a local search heuristic for facility location problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Local search heuristic for k-median and facility location problems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A hybrid VNS for connected facility location

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A tabu search heuristic procedure for the capacitated facility location problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The uncapacitated facility location problem (UFLP) is a problem that has been studied intensively in operational research. Recently a variety of new deterministic and heuristic approximation algorithms have evolved. In this paper, we consider five of these approaches - the JMS- and the MYZ-approximation algorithms, a version of Local Search, a Tabu Search algorithm as well as a version of the Volume algorithm with randomized rounding. We compare solution quality and execution times on different standard benchmark instances. With these instances and additional material a web page was set up [26], where the material used in this study is accessible.