Approximation algorithms for the stochastic priority facility location problem
From MaRDI portal
Publication:2868906
Cites work
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A new approximation algorithm for the \(k\)-facility location problem
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithm for facility location with service installation costs
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Stochastic Transportation-Inventory Network Design Problem
- The \(k\)-level facility location game
Cited in
(8)- Improved approximation algorithms for cumulative VRP with stochastic demands
- Approximation algorithms for the priority facility location problem with penalties
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- An approximation algorithm for the k-level stochastic facility location problem
- scientific article; zbMATH DE number 1947045 (Why is no real title available?)
- Approximation algorithms for \(k\)-level stochastic facility location problems
- On stochastic k-facility location
This page was built for publication: Approximation algorithms for the stochastic priority facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868906)
