Choice Network Revenue Management Based on New Tractable Approximations

References

• Ahuja RK, Orlin JB, Stein C, Tarjan RE (1994) Improved algorithms for bipartite network flow. SIAM J. Comput. 23(5):906–933.Crossref, Google Scholar
• Ben-Akiva M, Lerman S (1985) Discrete-Choice Analysis: Theory and Application to Travel Demand (MIT Press, Cambridge, MA).Google Scholar
• Bront JJM, Méndez-Díaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
• Chaneton J, Vulcano G (2011) Computing bid-prices for revenue management under customer choice behavior. Manufacturing Service Oper. Management 13(4):452–470.Link, Google Scholar
• Gallego G, Ratliff R, Shebalov S (2015) A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Technical Report TR-2004-01, Columbia University, New York.Crossref, Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2016) Online personalized resource allocation with customer choice. Technical Report, Columbia University, New York.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1988) Geometric Algorithms and Combinatorial Optimization (Springer, Berlin Heidelberg).Crossref, Google Scholar
• Hosseinalifam M, Marcotte P, Savard G (2016) A new bid price approach to dynamic resource allocation in network revenue management. Eur. J. Oper. Res. 255(1):142–150.Crossref, Google Scholar
• Kunnumkal S, Talluri K (2016) A note on relaxations of the choice network revenue management dynamic program. Oper. Res. 41(1):158–166.Link, Google Scholar
• Liu Q, van Ryzin GJ (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.Crossref, Google Scholar
• Meissner J, Strauss AK (2012) Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216(2):459–468.Crossref, Google Scholar
• Meissner J, Strauss AK, Talluri KT (2013) An enhanced concave programming method for choice network revenue management. Production Oper. Management 22(1):71–87.Crossref, Google Scholar
• Peeters R (2003) The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131(3):651–654.Crossref, Google Scholar
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Strauss AK, Talluri KT (2017) Tractable consideration set structures for assortment optimization and network revenue management. Production Oper. Management 26(7):1359–1368.Crossref, Google Scholar
• Talluri KT (2014) New formulations for choice network revenue management. INFORMS J. Comput. 26(2):401–413.Link, Google Scholar
• Talluri KT, van Ryzin GJ (2004) The Theory and Practice of Revenue Management (Kluwer, New York).Crossref, Google Scholar
• Vossen TWM, Zhang D (2015) Reductions of approximate linear program for network revenue management. Oper. Res. 63(6):1352–1371.Link, Google Scholar
• Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381–394.Link, Google Scholar