Performance of heuristic and approximation algorithms for the uncapacitated 
facility location problem

Hoefer, Martin

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Performance of heuristic and approximation algorithms for the uncapacitated facility location problem

MPS-Authors

/persons/resource/persons44628

Hoefer, Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-2002-1-005.pdf
(Any fulltext), 301KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Hoefer, M.(2002). Performance of heuristic and approximation algorithms for the uncapacitated facility location problem (MPI-I-2002-1-005). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6C92-E

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 compare five new approaches to this problem - 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 running times on different standard benchmark instances. With these instances and additional material a web page was set up, where the material used in this study is accessible.