An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

Ľuboš Buzna, Michal Koháni and Jaroslav Janáček

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/562373

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:562373

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().