Improved local search for universal facility location

DOI10.1007/s10878-014-9711-7zbMath1320.90042MaRDI QIDQ2354309

Damien Regnault, Nguyen Kim Thang, Eric Angel

Publication date: 10 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9711-7

zbMATH Keywords

approximation algorithm; connection cost; facility cost

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Local search algorithm for universal facility location problem with linear penalties, An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties, A note on LP-based approximation algorithms for capacitated facility location problem, Improved approximation algorithm for universal facility location problem with linear penalties, A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties

Cites Work

• Unnamed Item
• Unnamed Item
• From stars to comets: improved local search for universal facility location
• A 5-Approximation for Capacitated Facility Location
• A 3-Approximation for Facility Location with Uniform Capacities
• The facility location problem with general cost functions
• Local Search Heuristics for k-Median and Facility Location Problems
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Algorithms - ESA 2003