Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

References

• Anantharam V., Varaiya P., Walrand J. Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with multiple plays, part i: i.i.d. rewards. IEEE Trans. Automatic Control (1987a) AC-32(11):968–976Crossref, Google Scholar
• Anantharam V., Varaiya P., Walrand J. Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with multiple plays, part ii: Markovian rewards. IEEE Trans. Automatic Control (1987b) AC-32(11):977–982Crossref, Google Scholar
• Anderson S., de Palma A., Thisse J. F.Discrete Choice Theory of Product Differentiation (1992) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Auer P., Cesa-Bianchi N., Fischer P. Finite-time analysis of the multiarmed bandit problem. Machine Learn. (2002) 47(2–3):235–256Crossref, Google Scholar
• Ben-Akiva M., Lerman S. R.Discrete Choice Analysis: Theory and Application to Travel Demand (1985) (MIT Press, Cambridge, MA) Google Scholar
• Bierlaire M. BIOGEME: A free package for the estimation of discrete choice models. Proc. 3rd Swiss Transportation Res. Conf. (2003) Ascona, SwitzerlandGoogle Scholar
• Bodapati A. V., Gupta S. The recoverability of segmentation structure from store-level aggregation data. J. Marketing Res. (2004) 41(3):351–364Crossref, Google Scholar
• Bront J. M., Diaz I. M., Vulcano G. A column generation algorithm for choice-based network revenue management. Oper. Res. (2009) 57(3):769–784Link, Google Scholar
• Caro F., Gallien J. Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. (2007) 53(2):276–292Link, Google Scholar
• Cover T. M., Thomas J. A.Elements of Information Theory (2006) (Wiley, Hoboken, NJ) Google Scholar
• Gallego G., Iyengar G., Phillips R., Dubey A. Managing flexible products on a network. (2004) . Working paper, Columbia University, New YorkCrossref, Google Scholar
• Kök A. G., Fisher M. L., Vaidyanathan R., Agrawal N., Smith S. A. Assortment planning: Review of literature and industry practice. Retail Supply Chain Management (2009) (Springer, New York) 1–55Google Scholar
• Kunnumkal S., Topaloglu H. A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. (2008) 55(6):563–580Crossref, Google Scholar
• Lai T. L., Robbins H. Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. (1985) 6(1):4–22Crossref, Google Scholar
• Levi R., Roundy R. O., Shmoys D. B. Provably near-optimal sampling-based algorithms for stochastic inventory control models. Math. Oper. Res. (2007) 32(4):821–838Link, Google Scholar
• Liu Q., van Ryzin G. J. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management (2008) 10(2):288–310Link, Google Scholar
• Mahajan S., van Ryzin G. J., Tayur S., Ganeshan R., Magazine M. Retail inventories and consumer choice. Quantitative Models for Supply Chain Management (1998) (Kluwer Academic Publishers, Norwell, MA) 491–551Google Scholar
• Mahajan S., van Ryzin G. J. Stocking retail assortments under dynamic consumer substitution. Oper. Res. (2001) 49(3):334–351Link, Google Scholar
• McFadden D., Manski C. F., McFadden D. L. Econometric models of probabilistic choice. Structural Analysis Discrete Data and Econometric Applications (1981) (MIT Press, Cambridge, MA) Google Scholar
• Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4(4):414–424Link, Google Scholar
• Meissner J., Strauss A. K. Network revenue management with inventory-sensitive bid prices and customer choice. (2009) . Working paper, Management School, Lancaster University, Lancaster, UKGoogle Scholar
• Press W. H., Teukolsky S. A., Vetterling W. T., et al.Numerical Recipes in C, the Art of Scientific Computing (1999) (Cambridge University Press, Cambridge, UK) Google Scholar
• Ratliff R., Rao B. V., Narayan C. P., Yellepeddi K. A multi-flight recapture heuristic for estimating unconstrained demand from airline bookings. J. Revenue Pricing Management (2007) 7(2):153–171Crossref, Google Scholar
• Rusmevichientong P., Max Shen Z.-J., Shmoys D. B. A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. (2009) 37(4):230–238Crossref, Google Scholar
• Saure D., Zeevi A. Optimal dynamic assortment planning. (2008) . Working paper, Columbia Graduate School of Business, Columbia University, New YorkGoogle Scholar
• Shapiro A. Stochastic programming. Handbook in Operations Research and Management Science (2003) (Elsevier, Amsterdam) Google Scholar
• Shen Z.-J. M., Su X. Customer behavior modeling in revenue management and auctions: A review and new research opportunities. Production Oper. Management (2007) 16(6):713–728Crossref, Google Scholar
• Silberhorn N., Boztug Y., Hildebrandt L. Estimation with the nested logit model: Specifications and software particularities. OR Spectrum (2008) 30(4):635–653Crossref, Google Scholar
• Swamy C., Shmoys D. B. Sampling-based approximation algorithms for multi-stage stochastic optimization. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (2005) (IEEE Computer Society Press, Washington, DC) Crossref, Google Scholar
• Talluri K., van Ryzin G. J. Revenue management under a general discrete choice model of consumer behavior. Management Sci. (2004) 50(1):15–33Link, Google Scholar
• Vulcano G., van Ryzin G. J., Ratliff R. Estimating primary demand for substitutable products from sales transaction data. (2008) . Working paper, Stern School of Business, New York UniversityGoogle Scholar
• Zhang D., Adelman D. An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. (2009) 43(3):381–394Link, Google Scholar