Fully Distribution-Free Profit Maximization: The Inventory Management Case

References

• Axsäter S.Inventory Control (2006) 2nd ed.(Springer, Berlin) International Series in Operation Research & Management ScienceGoogle Scholar
• Ball M., Queyranne M. Toward robust revenue management: Competitive analysis of online booking. Oper. Res. (2009) 57(4):950–963Link, Google Scholar
• Ball M., Gao H., Karaesmen I. Revenue management and competition: Distribution-free methods. (2008) . Technical report, Robert H. Smith School of Business, University of Maryland, College ParkGoogle Scholar
• Ben-Tal A., Golany B., Nemirovski A. Retailer-supplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management (2005) 7(3):248–271Link, Google Scholar
• Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54(1):150–168Link, Google Scholar
• Borodin A., El-Yaniv R.Online Computation and Competitive Analysis (1998) (Cambridge University Press, Oxford, UK) Google Scholar
• Boyd S., Vandenberghe L.Convex Optimization (2004) (Cambridge University Press, Oxford, UK) Crossref, Google Scholar
• Buchbinder N., Kimbrelt T., Levi R., Makarychev K., Sviridenko M. Online make-to-order joint replenishment model: Primal dual competitive algorithms. Proc. Nineteenth Annual ACM-SIAM Sympos. Discrete Algorithms (2008) San Francisco:952–961Google Scholar
• Ehrhardt R. The power approximation for computing (s, S) inventory policies. Management Sci. (1979) 25(8):777–786Link, Google Scholar
• Gallego G., Moon I. The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. (1993) 44(8):825–834Crossref, Google Scholar
• Gao H., Ball M., Karaesmen I. Distribution-free methods for dynamic booking control. (2008) . Technical report, Robert H. Smith School of Business, University of Maryland, College ParkGoogle Scholar
• Godfrey G., Powell W. An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. (2001) 47(8):1101–1112Link, Google Scholar
• Huh W. T., Rusmevichientong P. A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. (2009) 34(1):103–123Link, Google Scholar
• Huh W. T., Rusmevichientong P. Online sequential optimization with biased gradients: Theory and applications to censored demand. (2009) . SubmittedGoogle Scholar
• Huh W. T., Janakiraman G., Muckstadt J. A., Rusmevichientong P. An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Math. Oper. Res (2009) 34(2):397–416Link, Google Scholar
• Huh W. T., Levi R., Rusmevichientong P., Orlin J. Adaptive data-driven inventory control policies based on Kaplan-Meier estimator for censored demand. Oper. Res. (2010) . ForthcomingGoogle Scholar
• Karlin A. R., Manasse M. S., Rudolph L., Sleator D. D. Competitive snoopy caching. Algorithmica (1988) 3(1):79–119Crossref, Google Scholar
• Lan Y., Ball M., Karaesmen I. Overbooking and fare-class allocation with limited information. (2008) . Technical report, Robert H. Smith School of Business, University of Maryland, College ParkGoogle Scholar
• Lan Y., Gao H., Ball M., Karaesmen I. Revenue management with limited demand information. Management Sci. (2008) 54(9):1594–1609Link, Google Scholar
• Levi R., Roundy R., Shmoys D. Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. (2007) 32(4):821–839Link, Google Scholar
• Ma W., Chen G. Competitive algorithms for the on-line inventory problem. Proc. Third Internat. Conf. Machine Learn. Cybernetics (2004) 2Shanghai, China:898–903Google Scholar
• Moon I., Gallego G. Distribution free procedures for some inventory models. J. Oper. Res. Soc. (1994) 45(6):651–658Crossref, Google Scholar
• Natarajan K., Sim M., Uichanco J. Asymmetry and ambiguity in newsvendor models. (2008) . Technical report, National University of Singapore Business School. SubmittedGoogle Scholar
• O'Neil S., Chaudhary A. Comparing online learning algorithms to stochastic approaches for the multi-period newsvendor problem. Proc. Tenth Workshop on Algorithm Engrg. Experiment: Workshop on Analytic Algorithmics and Combinatorics (2008) (SIAM, Philadelphia) 49–63Crossref, Google Scholar
• Perakis G., Roels G. Regret in the newsvendor model with partial information. Oper. Res. (2008) 56(1):188–203Link, Google Scholar
• Scarf H., Arrow K., Karlin S., Scarf H. A min-max solution of an inventory problem. Studies in the Mathematical Theory of Inventory and Production (1958) (Stanford University Press, Palo Alto, CA) 201–209Google Scholar
• See C., Sim M. Robust approximation to multi-period inventory management. Oper. Res. (2010) 58(3):583–594Link, Google Scholar
• Sleator D., Tarjan R. Amortized efficiency of list update and paging rules. Comm. ACM (1985) 28(2):202–208Crossref, Google Scholar
• Vairaktarakis G. Robust multi-item newsboy models with a budget constraint. Internat. J. Production Econom. (2000) 66(3):213–226Crossref, Google Scholar
• Wagner M. R. Inventory management via competitive analysis. (2009) . Technical report, submittedGoogle Scholar