Name
Title | ||
|---|---|---|
An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective. |
Abstract | ||
|---|---|---|
We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. Thelexicographic minimax optimumis a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve the p-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1155/2014/562373 | JOURNAL OF APPLIED MATHEMATICS |
Field | DocType | Volume |
Approximation algorithm,Mathematical optimization,Minimax,General purpose,Exact algorithm,Minimax approximation algorithm,Facility location problem,Lexicographical order,Mathematics | Journal | 2014 |
ISSN | Citations | PageRank |
1110-757X | 3 | 0.41 |
References | Authors | |
19 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lubos Buzna | 1 | 196 | 27.21 |
| Michal Koháni | 2 | 8 | 1.88 |
| Jaroslav Janácek | 3 | 3 | 1.08 |