On a Piecewise-Linear Approximation for Network Revenue Management

References

• Adelman D (2007) Dynamic bid-prices in revenue management. Oper. Res. 55(4):647–661.Link, Google Scholar
• Adelman D, Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 55(3):712–727.Link, Google Scholar
• Bodea T, Ferguson M, Garrow L (2009) Choice-based revenue management: Data from a major hotel chain. Manufacturing Service Oper. Management 11(2):356–361.Link, 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
• Erdelyi A, Topaloglu H (2009) A dynamic programming decomposition method for making overbooking decisions over an airline network. INFORMS J. Comput 22(3):443–456.Link, 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, Vol. 2 (Springer, Berlin).Crossref, Google Scholar
• Karaesmen I, van Ryzin GJ (2001) Coordinating overbooking and capacity control decisions on a network. Working paper, Graduate School of Business, Columbia University, New York.Google Scholar
• Kunnumkal S, Talluri KT (2012) A new compact linear programming formulation for choice network revenue management. Technical report, Universitat Pompeu Fabra, Barcelona, Spain.Google Scholar
• Kunnumkal S, Talluri KT (2012) Piecewise-linear approximations for choice network revenue management (in preparation). Technical report, Universitat Pompeu Fabra, Barcelona, Spain.Google Scholar
• Kunnumkal S, Topaloglu H (2010) Computing time-dependent bid prices in network revenue management problems. Transportation Sci. 44:38–62.Link, 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(5):575–590.Crossref, 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
• 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
• Méndez-Díaz I, Miranda Bront J, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164:246–263.Crossref, Google Scholar
• Talluri KT (2008) On bounds for network revenue management. Technical report WP-1066, UPF, Barcelona, Spain.Google Scholar
• Talluri KT, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Talluri KT, van Ryzin GJ (2004b) The Theory and Practice of Revenue Management (Kluwer, New York).Crossref, Google Scholar
• Tong C, Topaloglu H (2014) On approximate linear programming approach for network revenue management problems. INFORMS J. Comput. 26(1):131–134.Link, Google Scholar
• Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3):637–649.Link, Google Scholar