From stars to comets: Improved local search for universal facility location

Authors:
Jens Vygen
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstraíe 2, 53113 Bonn, Germany
Venue:
Operations Research Letters
Year:
2007

Citing 4
Cited 2

A faster strongly polynomial minimum cost flow algorithm

Operations Research
Analysis of a local search heuristic for facility location problems

Journal of Algorithms
Facility Location with Nonuniform Hard Capacities

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Improved approximation for universal facility location

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Lower-bounded facility location

ACM Transactions on Algorithms (TALG)
Generalized machine activation problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve the approximation ratio for the Universal Facility Location Problem to 6.702 by a local search algorithm with an extended pivot operation.