Fault-tolerant concave facility location problem with uniform requirements
From MaRDI portal
Publication:692668
DOI10.1007/s10255-012-0163-5zbMath1252.68353OpenAlexW2018064858MaRDI QIDQ692668
Da-Chuan Xu, Xing Wang, Zheng-Hai Huang
Publication date: 6 December 2012
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-012-0163-5
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An approximation algorithm for the fault tolerant metric facility location problem
- A new approximation algorithm for the \(k\)-facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Integrating facility location and production planning decisions
- Approximation Algorithms for Metric Facility Location Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
- Greedy Strikes Back: Improved Facility Location Algorithms
- The facility location problem with general cost functions
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- Stochastic Transportation-Inventory Network Design Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: Fault-tolerant concave facility location problem with uniform requirements
