Approximation algorithms for the stochastic priority facility location problem

DOI10.1080/02331934.2011.611511zbMath1278.90214OpenAlexW2023975861MaRDI QIDQ2868906

Zhen Wang, Gai-Di Li, Chen-Chen Wu

Publication date: 19 December 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.611511

zbMATH Keywords

approximation algorithmfacility location problemprimal-dual algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Discrete location and assignment (90B80) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Approximation algorithms for the priority facility location problem with penalties

Cites Work

• An approximation algorithm for the \(k\)-level capacitated facility location problem
• Approximation algorithm for facility location with service installation costs
• Approximation algorithms for soft-capacitated facility location in capacitated network design
• A new approximation algorithm for the \(k\)-facility location problem
• The \(k\)-level facility location game
• 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
• Stochastic Transportation-Inventory Network Design Problem
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

This page was built for publication: Approximation algorithms for the stochastic priority facility location problem