Local search algorithm for universal facility location problem with linear penalties
From MaRDI portal
Publication:506471
DOI10.1007/S10898-015-0394-0zbMATH Open1357.90084OpenAlexW2294719872MaRDI QIDQ506471FDOQ506471
Donglei Du, Dachuan Xu, Chenchen Wu, Yicheng Xu
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0394-0
Recommendations
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Improved approximation algorithm for universal facility location problem with linear penalties
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- Algorithms - ESA 2003
- Improved local search for universal facility location
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- Algorithms for facility location problems with outliers. (Extended abstract)
- Greedy Strikes Back: Improved Facility Location Algorithms
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A 3-Approximation for Facility Location with Uniform Capacities
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Algorithms - ESA 2003
- Title not available (Why is that?)
- LP-Based Algorithms for Capacitated Facility Location
- Analysis of a Local Search Heuristic for Facility Location Problems
- Improved local search for universal facility location
- An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
- From stars to comets: improved local search for universal facility location
- Improved approximation for universal facility location
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- A cost-sharing method for the multi-level economic lot-sizing game
Cited In (6)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- Approximation algorithms for the individually fair \(k\)-center with outliers
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
This page was built for publication: Local search algorithm for universal facility location problem with linear penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506471)
