Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model

References

• Anderson S, de Palma A, Thisse JF. Discrete Choice Theory of Product Differentiation (1992) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Ben-Akiva M, Lerman SR. Discrete Choice Analysis: Theory and Application to Travel Demand (1985) (MIT Press, Cambridge, MA) Google Scholar
• Ben-Tal A, Nemirovski A. Robust solutions of uncertain linear programs. Oper. Res. Lett. (1999) 25(1):1–13Crossref, Google Scholar
• Bertsimas D, Sim M. Robust discrete optimization and network flows. Math. Programming (2003) 98(1):49–71Crossref, Google Scholar
• Bertsimas D, Sim M. The price of robustness. Oper. Res. (2004) 52(1):35–53Link, Google Scholar
• Bertsimas D, Pachamanovab D, Sim M. Robust linear optimization under general norms. Oper. Res. Lett. (2004) 32(6):510–516Crossref, Google Scholar
• Birbil SI, Frank JBG, Gromicho JAS, Zhang S. The role of robust optimization in single-leg airline revenue management. Management Sci. (2009) 55(1):148–163Link, Google Scholar
• Boyd S, Vandenberghe L. Convex Optimization (2004) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Bront JM, Mendez Diaz I, Vulcano G. A column generation algorithm for choice-based network revenue management. Oper. Res. (2009) 57(3):769–784Link, Google Scholar
• Chaneton J, Vulcano G. Computing bid-prices for revenue management under customer choice behavior. Manufacturing Service Oper. Management (2011) 13(4):452–470Link, Google Scholar
• Farias VF, Jagabathula S, Shah D. A non-parametric approach to modeling choice with limited data. Management Sci. (2012) . ForthcomingGoogle Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A. Managing flexible products on a network. (2004) . Working paper, Columbia University, New YorkCrossref, Google Scholar
• Iyengar GN. Robust dynamic programming. Math. Oper. Res. (2005) 30(2):257–280Link, Google Scholar
• Kok AG, Fisher M, Vaidyanathan R. Assortment planning: Review of literature and industry practice. Retail Supply Chain Management (2008) (Springer, New York) Crossref, Google 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
• Kunnumkal S, Topaloglu H. A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management (2010) 19(5):575–590Crossref, Google Scholar
• Liu Q, van Ryzin GJ. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management (2008a) 10(2):288–310Link, Google Scholar
• Liu Q, van Ryzin GJ. Strategic capacity rationing to induce early purchases. Management Sci. (2008b) 54(6):1115–1131Link, Google Scholar
• Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4(4):414–424Link, Google Scholar
• Meissner J, Strauss AK. Improved bid prices for choice-based network revenue management. Eur. J. Oper. Res. (2012a) 217(2):417–427Crossref, Google Scholar
• Meissner J, Strauss AK. Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. (2012b) 216(2):459–468Crossref, Google Scholar
• Mendez-Diaz I, Miranda Bront J, Vulcano G, Zabala P. A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. (2012) . ForthcomingGoogle Scholar
• Perakis G, Roels G. Robust controls for network revenue management. Manufacturing Service Oper. Management (2010) 12(1):56–76Link, Google Scholar
• Phillips R. Efficient frontiers in revenue management. INFORMS Revenue Management and Pricing Sect. Conf. (2011) New York(INFORMS, Hanover, MD) Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB. Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. (2010a) 58(6):1666–1680Link, Google Scholar
• Rusmevichientong P, Shmoys DB, Topaloglu H. Assortment optimization with mixtures of logits. (2010b) . Working paper, Cornell University, Ithaca, NYGoogle Scholar
• Ruszczyński A. Nonlinear Optimization (2006) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Su X. Intertemporal pricing with strategic customer behavior. Management Sci. (2007) 53(5):726–741Link, Google Scholar
• Su X. Intertemporal pricing and consumer stockpiling. Oper. Res. (2010) 58(4):1133–1147Link, Google Scholar
• Talluri K. A randomized concave programming method for choice network revenue management. (2010) . Working paper, Universitat Pompeu Fabra, Barcelona, SpainGoogle Scholar
• Talluri K, van Ryzin GJ. Revenue management under a general discrete choice model of consumer behavior. Management Sci. (2004) 50(1):15–33Link, Google Scholar
• van Ryzin GJ, Mahajan S. On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. (1999) 45(11):1496–1509Link, Google Scholar
• van Ryzin GJ, Vulcano G. Computing virtual nesting controls for network revenue management under customer choice behavior. Manufacturing Service Oper. Management (2008) 10(3):448–467Link, Google Scholar
• Vulcano G, van Ryzin GJ, Chaar W. Choice-based revenue management: An empirical study of estimation and optimization. Manufacturing Service Oper. Management (2010) 12(3):371–392Link, Google Scholar
• Vulcano G, van Ryzin GJ, Ratliff R. Estimating primary demand for substitutable products from sales transaction data. Oper. Res. (2012) 60(2):313–334Link, Google Scholar
• Zhang D. An improved dynamic programming decomposition approach for network revenue management. Manufacturing Service Oper. Management (2011) 13(1):35–52Link, Google 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