Computing Near-Optimal Policies in Generalized Joint Replenishment

References

• Adelman D. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management (2003) 5(4):348–371Link, Google Scholar
• Adelman D. A price-directed approach to stochastic inventory/routing. Oper. Res. (2004) 52(4):499–514Link, Google Scholar
• Adelman D., Klabjan D. Duality and existence of optimal policies in generalized joint replenishment. Math. Oper. Res. (2005) 30(1):28–50Link, Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. (2003) 49(9):1268–1273Link, Google Scholar
• de Farias D. P., Van Roy B. The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865Link, Google Scholar
• de Farias D. P., Van Roy B. On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. (2004) 29(3):462–478Link, Google Scholar
• Dror M., Langevin A., Riopel D. Routing propane deliveries. Logistics Systems: Design and Optimization (2005) (Springer, New York) 299–322Crossref, Google Scholar
• Goyal S. K. Comment on “A dynamic programming approach for joint replenishment under general order cost functions”. Management Sci. (1987) 33(1):133–135Link, Google Scholar
• Hernández-Lerma O., Lasserre J. B.Discrete-Time Markov Control Processes: Basic Optimality Criteria (1996) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Klabjan D., Adelman D. Existence of optimal policies for semi-Markov decision processes using duality for infinite linear programming. SIAM J. Control Optim. (2006) 44(6):2104–4122Crossref, Google Scholar
• Klabjan D., Adelman D. An infinite-dimensional linear programming algorithm for deterministic semi-Markov decision processes on Borel spaces. Math. Oper. Res. (2007) 32(3):528–550Link, Google Scholar
• Powell W. B.Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007) (John Wiley & Sons, New York) Crossref, Google Scholar
• Queyranne M. Comment on “A dynamic programming algorithm for joint replenishment under general order cost functions”. Management Sci. (1987) 33(1):131–133Link, Google Scholar
• Rosenblatt M. J., Kaspi M. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. (1985) 31(3):369–373Link, Google Scholar
• Schweitzer P. J., Seidmann A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110(2):568–582Crossref, Google Scholar