Analysis of a local search algorithm for the k-facility location problem
From MaRDI portal
Analysis of a local search algorithm for the \(k\)-facility location problem
Recommendations
- Local Search Heuristics for k-Median and Facility Location Problems
- Local search heuristic for k-median and facility location problems
- scientific article; zbMATH DE number 1303535
- Analysis of a Local Search Heuristic for Facility Location Problems
- A new approximation algorithm for the k-facility location problem
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A constant-factor approximation algorithm for the k-median problem
- A new approximation algorithm for the k-facility location problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Facility location models for distribution system design
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Improved Combinatorial Algorithms for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Mobile wireless sensor network connectivity repair with k-redundancy
Cited in
(4)
This page was built for publication: Analysis of a local search algorithm for the \(k\)-facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186668)