A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
From MaRDI portal
Publication:5704227
DOI10.1287/moor.1040.0125zbMath1082.90057OpenAlexW2074048915MaRDI QIDQ5704227
Yinyu Ye, Bo Chen, Jia-Wei Zhang
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0125
Related Items (57)
An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties ⋮ Combinatorial approximation algorithms for the robust facility location problem with penalties ⋮ Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties ⋮ Site selection in the US retailing industry ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ A 3-approximation algorithm for the facility location problem with uniform capacities ⋮ An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem ⋮ Approximation Algorithms for the Robust Facility Location Problem with Penalties ⋮ An approximation algorithm for the \(k\)-level stochastic facility location problem ⋮ An approximation algorithm for the \(k\)-level capacitated facility location problem ⋮ Strategyproof facility location with limited locations ⋮ An approximation algorithm for the dynamic facility location problem with submodular penalties ⋮ A cost-sharing method for the multi-level economic lot-sizing game ⋮ Approximation algorithm for squared metric facility location problem with nonuniform capacities ⋮ Centrality of trees for capacitated \(k\)-center ⋮ The facility location problem with maximum distance constraint ⋮ Improved approximation algorithm for universal facility location problem with linear penalties ⋮ A primal-dual approximation algorithm for the facility location problem with submodular penalties ⋮ Approximation algorithms for the priority facility location problem with penalties ⋮ A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem ⋮ An approximation algorithm for soft capacitated \(k\)-facility location problem ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem ⋮ Donation center location problem ⋮ Improved approximation algorithms for the robust fault-tolerant facility location problem ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ A primal-dual approximation algorithm for stochastic facility location problem with service installation costs ⋮ An approximation algorithm for the \(k\)-median warehouse-retailer network design problem ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ A constant FPT approximation algorithm for hard-capacitated \(k\)-means ⋮ Approximation algorithm for facility location with service installation costs ⋮ A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations ⋮ Capacitated Domination Problem ⋮ Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach ⋮ LP-based approximation algorithms for capacitated facility location ⋮ A cost-sharing method for an uncapacitated facility location game with penalties ⋮ RAMP algorithms for the capacitated facility location problem ⋮ Local search algorithm for universal facility location problem with linear penalties ⋮ Approximating soft-capacitated facility location problem with uncertainty ⋮ Fault-tolerant concave facility location problem with uniform requirements ⋮ A per-scenario bound for the two-stage stochastic facility location problem with linear penalty ⋮ Capacitated domination problem ⋮ Soft-capacitated facility location game ⋮ An improved per-scenario bound for the two-stage stochastic facility location problem ⋮ Unnamed Item ⋮ Cost-effective designs of fault-tolerant access networks in communication systems ⋮ A local search approximation algorithm for a squared metric \(k\)-facility location problem ⋮ Approximation algorithms for the transportation problem with market choice and related models ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties ⋮ Improved approximation algorithms for the facility location problems with linear/submodular penalties ⋮ A cost-sharing method for an economic lot-sizing game ⋮ A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties ⋮ An approximation algorithm for the uniform capacitated \(k\)-means problem ⋮ A cross-monotonic cost sharing method for the facility location game with service installation costs ⋮ Improved local search for universal facility location
This page was built for publication: A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
