A constant approximation algorithm for the one-warehouse multi-retailer problem

Authors:
Retsef Levi;Robin Roundy;David B. Shmoys
Affiliations:
Cornell University, Ithaca, NY;Cornell University, Ithaca, NY;Cornell University, Ithaca, NY
Venue:
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2005

Citing 7
Cited 9

Lot-sizing with constant batches: formulation and valid inequalities

Mathematics of Operations Research
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures

Management Science
Primal-dual algorithms for deterministic inventory problems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On dependent randomized rounding algorithms

Operations Research Letters

Online make-to-order joint replenishment model: primal dual competitive algorithms

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Power-of-Two Ordering Policy for One-Warehouse Multiretailer Systems with Stochastic Demand

Operations Research
Optimizing replenishment polices using Genetic Algorithm for single-warehouse multi-retailer system

Expert Systems with Applications: An International Journal
Inventory and facility location models with market selection

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Improved approximation algorithm for the one-warehouse multi-retailer problem

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for the joint replenishment problem with deadlines

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Online control message aggregation in chain networks

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Online aggregation problems

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deterministic inventory theory provides streamlined optimization models that attempt to capture tradeoffs in managing the flow of goods through a supply chain. We will consider a well-studied inventory model, called the one-warehouse multi-retailer problem (OWMR). and give the first approximation algorithm with constant performance guarantee; more specifically, we give a 2.398-approximation algorithm. Our results are based on an LP-rounding approach, and hence not only provide good algorithmic results, but show strong integrality gaps for these linear programs. Furthermore, we extend this result to obtain a constant performance guarantee for a capacitated variant of this model.