An improved per-scenario bound for the two-stage stochastic facility location problem

DOI10.1007/s11425-014-4933-9zbMath1308.90157OpenAlexW2005775341MaRDI QIDQ2018918

Chen-Chen Wu, Dong-lei Du, Da-Chuan Xu

Publication date: 26 March 2015

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-014-4933-9

zbMATH Keywords

approximation algorithmfacility location problemLP-rounding algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Approximation algorithm for squared metric two-stage stochastic facility location problem ⋮ Approximation algorithms for the robust/soft-capacitated 2-level facility location problems ⋮ LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for soft-capacitated facility location in capacitated network design
• A new approximation algorithm for the \(k\)-facility location problem
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• Approximating the two-level facility location problem via a quasi-greedy approach
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Approximation Algorithms for Metric Facility Location Problems
• An approximation scheme for stochastic linear programming and its application to stochastic integer programs
• Improved Approximation Algorithms for the Uncapacitated Facility Location 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: An improved per-scenario bound for the two-stage stochastic facility location problem