Improved Approximation Algorithms for Inventory Problems
From MaRDI portal
Publication:5041737
DOI10.1007/978-3-030-45771-6_8zbMath1503.90003arXiv1912.00101OpenAlexW3021088427MaRDI QIDQ5041737
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00101
Related Items
Cites Work
- The submodular joint replenishment problem
- Approximation algorithms for inventory problems with submodular or routing costs
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic Version of the Economic Lot Size Model
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
- Submodular Cost Allocation Problem and Applications
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- Better Approximation Bounds for the Joint Replenishment Problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Steiner Tree Approximation via Iterative Randomized Rounding
- Approximation Algorithms for Submodular Multiway Partition
- Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems