Efficient, effective lot sizing for multistage production systems
Operations Research
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On dependent randomized rounding algorithms
Operations Research Letters
A constant approximation algorithm for the one-warehouse multi-retailer problem
SODA '05 Proceedings of the sixteenth 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
ESA'11 Proceedings of the 19th European conference on Algorithms
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
| Hi-index | 0.00 |
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. These inventory models have been studied extensively, and play a fundamental role in broader planning issues, such as the management of supply chains. We shall give a novel primal-dual framework for designing algorithms for these models that significantly improve known results in several ways: the performance guarantees for the quality of the solutions improve on or match previously known results; the performance guarantees hold under much more general assumptions about the structure of the costs, and the algorithms and their analysis are significantly simpler than previous known results. Finally, our primal-dual framework departs from the structure of previously studied primal-dual approximation algorithms in significant ways, and we believe that our approach may find application in other settings.We provide 2-approximation algorithms for the joint replenishment problem and for the assembly problem, and solve the single-item lot-sizing problem to optimality. The results for the joint replenishment and the lot-sizing problems also hold for their generalizations with back orders allowed. As a byproduct of our work, we prove known and new upper bounds on the integrality gap of the LP relaxations for these problems.