Abstract
We analyze a simple local search heuristic for the facility location problem using the notion of perturbation resilience: an instance is γ-perturbation resilient if all costs can be perturbed by a factor of γ without changing the optimal solution. We prove that local search for FLP succeeds in finding the optimal solution for γ-perturbation resilient instances for γ≥3, and we show that this is tight.
Original language | English |
---|---|
Pages (from-to) | 215-218 |
Number of pages | 4 |
Journal | Operations research letters |
Volume | 46 |
Issue number | 2 |
Early online date | 31 Jan 2018 |
DOIs | |
Publication status | Published - 1 Mar 2018 |
Keywords
- Local search
- Perturbation resilience
- Facility location problem