New Formulations for Choice Network Revenue Management

Published Online:https://doi.org/10.1287/ijoc.2013.0573

References

  • Bertsekas DP (1999) Nonlinear Programming, 2nd ed. (Athena Scientific, Belmont, MA).Google Scholar
  • Bodea T, Ferguson M, Garrow L (2009) Choice-based revenue management: Data from a major hotel chain. Manufacturing Service Oper. Management 11:356–361.LinkGoogle Scholar
  • Bront JJM, Méndez-Díaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57:769–784.LinkGoogle Scholar
  • Gallego G, Ratliff R, Shebalov S (2010) A general attraction model and an efficient formulation for the network revenue management problem. Technical report, Department of IEOR, Columbia University, New York. http://www.columbia.edu/~gmg2/.Google Scholar
  • Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Technical Report TR-2004-01, Department of Industrial Engineering, Columbia University, New York.Google Scholar
  • Grötschel M, Lovász L, Schrijver A (1988) Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, Vol. 2 (Springer-Verlag, Berlin).CrossrefGoogle Scholar
  • Hauser JR, Wernerfelt B (1990) An evaluation cost model of consideration sets. J. Consumer Res. 16:393–408.CrossrefGoogle Scholar
  • Kök G, Fisher ML, Vaidyanathan R (2009) Assortment planning: Review of literature and industry practice. Agrawal N, Smith SA, eds. Retail Supply Chain Management: Quantitative Models and Empirical Studies (Springer, New York), 99–154.Google Scholar
  • Kunnumkal S, Topaloglu H (2010) A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management 19:575–590.CrossrefGoogle Scholar
  • Liu Q, van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10:288–310.LinkGoogle Scholar
  • Maglaras C, Meissner J (2006) Dynamic pricing strategies for multi-product revenue management problems. Manufacturing Service Oper. Management 8:136–148.LinkGoogle Scholar
  • Meissner J, Strauss AK (2012) Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216:459–468.CrossrefGoogle Scholar
  • Meissner J, Strauss AK, Talluri KT (2013) An enhanced concave programming method for choice network revenue management. Production Oper. Management 22:71–87.CrossrefGoogle Scholar
  • Rusmevichientong P, Shmoys D, Topaloglu H (2010) Assortment optimization with mixtures of logits. Technical report, School of IEOR, Cornell University, Ithaca, NY.Google Scholar
  • Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).CrossrefGoogle Scholar
  • Strauss AK, Talluri KT (2012) A tractable consideration set structure for network revenue management. Technical report, Working Paper 1303, Department of Economics, Universitat Pompeu Fabra. http://www.econ.upf.edu/en/research/onepaper.php?id=1215.Google Scholar
  • Talluri KT (2001) Airline revenue management with passenger routing control: A new model with solution approaches. Internat. J. Services Tech. Management 2:102–115.CrossrefGoogle Scholar
  • Talluri K, van Ryzin G (1999) A randomized linear programming method for computing network bid prices. Transportation Sci. 33:207–216.LinkGoogle Scholar
  • Talluri K, van Ryzin G (2004a) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50:15–33.LinkGoogle Scholar
  • Talluri KT, van Ryzin GJ (2004b) The Theory and Practice of Revenue Management (Kluwer, New York).CrossrefGoogle Scholar
  • Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57:637–649.LinkGoogle Scholar
  • Topaloglu H (2010) Joint stocking and product offer decisions under the multinomial logit model. Technical report, School of IEOR, Cornell University, Ithaca, NY. http://people.orie.cornell.edu/huseyin/publications/retail_assort.pdf.Google Scholar
  • Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43:381–394.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.