Analysis of a Local Search Heuristic for Facility Location Problems

Recommendations

scientific article; zbMATH DE number 1303535
Analysis of a local search algorithm for the k-facility location problem
scientific article; zbMATH DE number 18531
Local Search Heuristics for k-Median and Facility Location Problems
Local search heuristic for k-median and facility location problems
Local search approximation algorithms for the sum of squares facility location problems
scientific article; zbMATH DE number 1189252
Local search heuristics for the mobile facility location problem
scientific article; zbMATH DE number 2159272
Observations on some heuristic methods for the capacitated facility location problem

Cited in

(92)

A comparative performance analysis of evolutionary algorithms on k-median and facility location problems
Complexity of single-swap heuristics for metric facility location and related problems
A local search approximation algorithm for the uniform capacitated k-facility location problem
Improved approximation algorithms for capacitated facility location problems
Approximation algorithms for the transportation problem with market choice and related models
A constant-factor approximation algorithm for the k-median problem
Maximum gradient embeddings and monotone clustering
Easy capacitated facility location problems, with connections to lot-sizing
Heuristics for the dynamic facility location problem with modular capacities
An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
An approximation algorithm for the uniform capacitated $k$-means problem
To close is easier than to open: dual parameterization to $k$-median
Bifactor approximation for location routing with vehicle and facility capacities
LP-based approximation for uniform capacitated facility location problem
A note on LP-based approximation algorithms for capacitated facility location problem
Probabilistic analysis of facility location on random shortest path metrics
$\mathrm{M}^p$UFLP: universal facility location problem in the $p$-th power of metric space
Facility location problems: a parameterized view
The ordered $k$-median problem: surrogate models and approximation algorithms
An approximation algorithm for the $n$th power metric facility location problem with linear penalties
A new approximation algorithm for the k-facility location problem
Perturbation resilience for the facility location problem
An approximation algorithm for the dynamic facility location problem with outliers
Approximation algorithm for squared metric facility location problem with nonuniform capacities
Approximation algorithm for squared metric two-stage stochastic facility location problem
Improved approximation algorithm for universal facility location problem with linear penalties
A primal-dual approximation algorithm for the facility location problem with submodular penalties
From stars to comets: improved local search for universal facility location
Incremental medians via online bidding
An approximation algorithm for a facility location problem with stochastic demands and inventories
Incremental algorithms for facility location and $k$-median
Locating repair shops in a stochastic environment
Approximation algorithms for hard capacitated $k$-facility location problems
On the mass COVID-19 vaccination scheduling problem
Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
Respecting lower bounds in uniform lower and upper bounded facility location problem
scientific article; zbMATH DE number 1670526 (Why is no real title available?)
Approximating k-median via pseudo-approximation
Solving facility location problem based on duality approach
LP-based algorithms for capacitated facility location
Analysis of a local search algorithm for the k-facility location problem
Optimal Physician assignment and patient demand allocation in an outpatient care network
Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
Local search algorithms for $k$-median and $k$-facility location problems with linear penalties
A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
A 3-approximation algorithm for the facility location problem with uniform capacities
scientific article; zbMATH DE number 1303535 (Why is no real title available?)
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
Approximation algorithm for resource allocation problems with time dependent penalties
Local Search Heuristics for k-Median and Facility Location Problems
Recent developments in approximation algorithms for facility location and clustering problems
A local-search algorithm for Steiner forest
Privacy preserving clustering with constraints
Observations on some heuristic methods for the capacitated facility location problem
Local search algorithm for universal facility location problem with linear penalties
Constant-Factor FPT Approximation for Capacitated k-Median
Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
Temporal clustering
Local search heuristic for k-median and facility location problems
A survey on approximation algorithms for facility location problems
The capacitated facility location problem with random input data
A distributed O(1)-approximation algorithm for the uniform facility location problem
Capacitated domination problem
Capacitated Domination Problem
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
scientific article; zbMATH DE number 7651148 (Why is no real title available?)
Theory and Applications of Models of Computation
Approximation algorithms for bounded facility location problems
scientific article; zbMATH DE number 7765379 (Why is no real title available?)
Improved bounds for metric capacitated covering problems
Constant-factor approximation algorithms for parity-constrained facility location and $k$-center
Robust facility location in reverse logistics
Improved lower bound for differentially private facility location
LP-based approximation algorithms for capacitated facility location
Airports and railways with unsplittable demand
Respecting lower bounds in uniform lower and upper bounded facility location problem
Buy-at-bulk facility location on trees
Approximation algorithms for individual preference facility location
A polynomial-time exact algorithm for the connected k-facility location problem on trees
Local search algorithms for the red-blue median problem
SDP-based Benders decomposition for solving p-median quadratic facility location problems
Uniform capacitated facility location with outliers/penalties
Approximation algorithm for the k-product uncapacitated facility location problem with penalties
A nearly optimal deterministic online algorithm for non-metric facility location
Individual preference facility location: a dual-fitting framework and its extensions
Capacitated facility location with outliers and uniform facility costs
Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii
Approximation scheme for the single-client capacitated facility location problem with operational cost budget constraint
Approximation and parameterized algorithms for covering with disks of two types of radii
Approximation algorithms for facility location problems with a special class of subadditive cost functions
Centrality of trees for capacitated $k$-center
A new approximation algorithm for the multilevel facility location problem

This page was built for publication: Analysis of a Local Search Heuristic for Facility Location Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512576)