Inventory placement on a network
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A new greedy approach for facility location problems
- A threshold of ln n for approximating set cover
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Greedy Strikes Back: Improved Facility Location Algorithms
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- scientific article; zbMATH DE number 6474898 (Why is no real title available?)
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- On the power of static assignment policies for robust facility location problems
This page was built for publication: Inventory placement on a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988118)