Approximating soft-capacitated facility location problem with uncertainty

DOI10.1007/s10878-012-9573-9zbMath1291.90120arXiv1207.0271OpenAlexW2163139470MaRDI QIDQ2251144

Yaohua Tang, Shuxin Cai, Wenguo Yang

Publication date: 11 July 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.0271

zbMATH Keywords

robustapproximation algorithmfacility locationstochastic2-stagesoft-capacitated

Mathematics Subject Classification ID

Continuous location (90B85) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Improved approximation algorithms for the robust fault-tolerant facility location problem
• Robust Fault Tolerant uncapacitated facility location
• Approximation Algorithms for Metric Facility Location Problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
• A new greedy approach for facility location problems
• A Dual-Based Procedure for Dynamic Facility Location
• Local search heuristic for k-median and facility location problems
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating soft-capacitated facility location problem with uncertainty