Primal-Dual Algorithms for Deterministic Inventory Problems

References

• Archer A. Inapproximability of the asymmetric facility location and k-median problems. (2000) . Working paper, Algorithm and Optimization Group, AT&T, Shannon Research Laboratory, Florham Park, NJGoogle Scholar
• Arkin E., Joneja D., Roundy R. Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. (1989) 8:61–66Crossref, Google Scholar
• Askoy Y., Erenguk S. S. Multi-item inventory models with coordinated replenishment: A survey. Internat. J. Oper. Production Management (1988) 8:63–73Crossref, Google Scholar
• Bárány I., Van Roy T. J., Wolsey L. A. Uncapacitated lot-sizing: The convex hull of solutions. Math. Programming Study (1984) 22:32–43Crossref, Google Scholar
• Bertsimas D., Teo C., Vohra R. On dependent randomized rounding algorithms. Oper. Res. Lett. (1999) 25:105–114Crossref, Google Scholar
• Bussieck M. R., Fink A., Lübbecke M. E. Yet another note on “An efficient zero-one formulation of the multilevel lot-sizing problem.”. (1998) . Technical report, Department of Mathematical Optimization, Braunschweig University of Technology, Braunschweig, GermanyGoogle Scholar
• Chuzhoy Julia, Guha Sudipto, Halperin Eran, Khanna Sanjeev, Kortsarz Guy, Krauthgamer Robert, Naor Joseph. Asymmetric k-center is log*n-hard to approximate. J. ACM (2005) 52(4):538–551Crossref, Google Scholar
• Crowston W. B., Wagner M. H. Dynamic lot size models for multi-stage assembly systems. Management Sci. (1973) 20:14–21Link, Google Scholar
• Federgruen A., Tzur M. The joint replenishment problem with time-varying parameters: Efficient, asymptotic and epsilon-optimal solutions. Oper. Res. (1994) 42:1067–1087Link, Google Scholar
• Goemans M. X., Williamson D. P. A general approximation technique for constrained forest problems. SIAM J. Comput. (1995) 24:296–317Crossref, Google Scholar
• Jain K., Vazirani V. V. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM (2001) 48:274–296Crossref, Google Scholar
• Joneja D. Multi-echelon and joint replenishment production and distribution systems with nonstationary demand. (1987) . Technical report 731, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NYGoogle Scholar
• Joneja D. Planning for joint replenishment and assembly systems with deterministic non-stationary demands. (1989) . Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NYGoogle Scholar
• Joneja D. The joint replenishment problem: New heuristics and worst case performance bounds. Oper. Res. (1990) 38:723–771Link, Google Scholar
• Kao E. P. C. A multi-product dynamic lot-size model with individual and joint set-up costs. Oper. Res. (1979) 27:279–289Link, Google Scholar
• Krarup J., Bilde O., Collatz L., Wetterling W. Plant location, set covering and economic lot sizing: An O(mn) algorithm for structural problems. Numerische Methoden bei Optimierungsaufgaben—Band 3 (Optimierung bei Graphentheoretischen und Ganzzahligen Problemen) (1977) Vol. 36(Birkhauser Verlag, Basel, Switzerland) 155–180International Series of Numerical MathematicsCrossref, Google Scholar
• Levi R., Roundy R. O. A note on Joneja’s joint replenishment problem approximation algorithm. . In preparationGoogle Scholar
• Raghavan P., Rao M. R. The multi-item lot sizing problem with joint replenishment: A polyhedral approach. (1991) . Technical report SOR-91-8, Stern School of Business, New York University, New YorkGoogle Scholar
• Raghavan P., Rao M. R. Formulations to the multi-item lot sizing problem with joint replenishment. (1992) . Technical report SOR-92-19, Stern School of Business, New York University, New YorkGoogle Scholar
• Roundy R. O. Efficient, effective lot-sizing for multi-product, multi-stage production systems. Oper. Res. (1993) 41:371–386Link, Google Scholar
• Roundy R. O., Levi R., Shmoys D. B. A lower bound on the integrality gap for a strong IP formulation for the joint replenishment problem. (2003) . Working paper, Department of Operations Research and Industrial Engineering, Cornell University, Ithaca, NYGoogle Scholar
• Shen Z. J., Simchi-Levi D., Teo C. P. Approximation algorithms for the single-warehouse multi-retailer problem with piecewise linear cost structures. . http://citeseer.nj.nec.com/439759.htmlGoogle Scholar
• Shmoys D. B., Swamy C., Levi R. Facility location with service installation costs. Proc. 15th Annual SIAM-ACM Sympos. Discrete Algorithms (2004) New York:1081–1090Google Scholar
• van Hoesel A., Wagelmans A., Kolen A. A dual algorithm for the economic lot-sizing problem. Eur. J. Oper. Res. (1991) 52:315–325Crossref, Google Scholar
• Veinott A. F. Minimum concave cost solutions of Leontief substitution models of multi-facility inventory systems. Oper. Res. (1969) 17:262–291Link, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot sizing model. Management Sci. (1958) 5:89–96Link, Google Scholar
• Zangwill W. I. A deterministic multi-product, multi-facility production and inventory model. Oper. Res. (1966) 14:486–507Link, Google Scholar