MPI-I-2002-1-005. December 2002, 27 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
Categories / Keywords: facility location; experimental study; benchmark library
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
338 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |