Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

Published Online:https://doi.org/10.1287/opre.46.1.96

References

  • Anily S. , Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990) 36 92 114 LinkGoogle Scholar
  • Anily S. , Federgruen A. Rejoinder to “comments on one warehouse multiple retailer systems with vehicle routing costs”. Management Sci. (1991) 37 1497 1499 LinkGoogle Scholar
  • Bramel J. , Simchi-Levi D. A location based heuristic for general routing problems. Opns. Res. (1995) 43 649 660 LinkGoogle Scholar
  • Carr C. R. , Howe C. W. Optimal service policies and finite time horizons. Management Sci. (1962) 9 126 140 LinkGoogle Scholar
  • Chan L. M. A. Probabilistic analysis of inventory-routing models. (1995) . Ph.D. thesis, Columbia University Google Scholar
  • Coffman E. G. , Lueker G. S. Probabilistic Analysis of Packing and Partitioning Algorithms (1991) (John Wiley & Sons Ltd., New York) Google Scholar
  • Federgruen A. , Queyranne M. , Zheng Y. S. Simple power of two policies are close to optimal in a general class of production/distribution networks with general setup costs. Math. O. R. (1992) 17 951 963 LinkGoogle Scholar
  • Federgruen A. , Zheng Y. S. The joint replenishment problem with general joint cost structures: General solution methods and performance bounds. Opns. Res. (1992) 40 384 404 LinkGoogle Scholar
  • Federgruen A. , Simchi-Levi D. Routing and inventory control models for general distribution networks. (1992a) . Working paper, Columbia University Google Scholar
  • Federgruen A. , Simchi-Levi D. , Ball M. , Magnanti T. , Monma C. , Nemhauser G. Analytical analysis of vehicle routing and inventory routing problems. Handbooks in Operations Research and Management Science, Network Routing (1995) (North-Holland, Amsterdam) 297 373 Google Scholar
  • Gallego G. , Simchi-Levi D. On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R-systems. Management Sci. (1990) 36 240 243 LinkGoogle Scholar
  • Hall R. W. Comments on “one-warehouse multiple retailer systems with vehicle routing costs”. Management Sci. (1991) 37 1496 1497 LinkGoogle Scholar
  • Herer Y. , Roundy R. Heuristics for a one-warehouse multiretailer distribution problem with performance bounds. Opns. Res. (1997) 45 102 115 LinkGoogle Scholar
  • Jackson P. L. , Maxwell W. L. , Muckstadt J. A. The joint replenishment problem with powers of two restriction. AIIE Trans. (1985) 17 25 32 Google Scholar
  • Jesse R. R. , Mitra A. , Cox J. F. EOQ formula: Is it valid under inflationary conditions. Decision Sci. (1983) 14 370 374 CrossrefGoogle Scholar
  • Karmarkar N. Probabilistic analysis of some bin-packing algorithms. Proc. 23rd Annual Sympos. Foundations Comput. Sci. (1982) 107 111 Google Scholar
  • Kingman J. F. C. Subadditive processes. Lecture Notes in Math. 539 (1976) (Springer-Verlag, Berlin) 168 222 CrossrefGoogle Scholar
  • Lee H. L. , Nahmias S. , Graves S. C. , Rinnooy Kan A. H. G. , Zipkin P. H. Single product, single location models. Handbooks in Operations Research and Management Science (1993) 3 55 . The volume on Logistics of Production and Inventory Google Scholar
  • Porteus E. L. Undiscounted approximations of discounted regenerative models. O. R. Lett. (1985) 3 293 300 CrossrefGoogle Scholar
  • Rhee W. T. , Talagrand M. Martingale inequalities and NP-complete problems. Math. O. R. (1987) 12 177 181 LinkGoogle Scholar
  • Rhee W. T. Optimal bin packing with items of random sizes. Math. O. R. (1988) 13 140 151 LinkGoogle Scholar
  • Stalk G. , Evans P. , Shulman L. E. Competing on capabilities: The new rule of corporate strategy. Harvard Bus. Rev. (1992) 57 69 Google Scholar
  • Viswanathan S. , Mathur K. Integrating routing and inventory decisions in one warehouse multiretailer multiproduct distribution systems. Management Sci. (1997) 43 294 312 LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.