An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
From MaRDI portal
Publication:2441152
DOI10.1007/s11425-013-4704-zzbMath1292.90254MaRDI QIDQ2441152
Yu Li, Nai-Hua Xiu, Da-Chuan Xu
Publication date: 21 March 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4704-z
Related Items
Local search algorithm for universal facility location problem with linear penalties, An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
Cites Work
- Unnamed Item
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Facility location and supply chain management. A review
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Warehouse-Retailer Network Design Problem
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- The facility location problem with general cost functions
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Stochastic Transportation-Inventory Network Design Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem