Reductions of Approximate Linear Programs 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. 56(3):712–727.Link, Google Scholar
• Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463.Link, Google Scholar
• Bertsekas DP, Tsitsiklis JN (1996) Neuro-Dynamic Programming (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Popescu I (2003) Revenue management in a dynamic network environment. Transportation Sci. 37(3):257–277.Link, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization (Athena Scientific, Belmont, MA).Google Scholar
• Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.Link, Google Scholar
• Dantzig G, Wolfe P (1960) Decomposition principle for linear programs. Oper. Res. 8(1):101–111.Link, Google Scholar
• Dantzig GB, Wolfe P (1961) The decomposition algorithm for linear programs. Econometrica 29(4):767–778.Crossref, Google Scholar
• de Farias D, Van Roy B (2004) On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. 29(3):462–478.Link, Google Scholar
• de Farias DP, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Oper. Res. 51(6):850–865.Link, Google Scholar
• Desrosiers J, Lübbecke ME (2005) A primer in column generation. Column Generation (Springer, New York).Crossref, Google Scholar
• Farias VF, Van Roy B (2007) An approximate dynamic programming approach to network revenue mangement. Working paper, MIT Sloan School of Management.Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network, CORC Technical Report Tr-2004-01, IEOR Department, Columbia University, New York.Google Scholar
• Gallego G, van Ryzin GJ (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1): 24–41.Link, Google Scholar
• Kunnumkal S, Talluri K (2011) Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management. Working paper, Barcelona Graduate School of Economics.Google Scholar
• Kunnumkal S, Talluri K (2014) On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management. Working paper, Barcelona Graduate School of Economics.Google Scholar
• Lautenbacher C, Stidham S (1999) The underlying Markov decision process in the single-leg airline yield management problem. Transportation Sci. 33(2):136–146.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
• 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
• Powell W (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley-Interscience, Hoboken, NJ).Crossref, Google Scholar
• Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, New York).Crossref, Google Scholar
• Schweitzer PJ, Seidmann A (1985) Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110(2):568–582.Crossref, Google Scholar
• Talluri K (2008) On bounds for network revenue management. Working paper, Universitat Pompeu Fabra.Crossref, Google Scholar
• Talluri K, van Ryzin GJ (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.Link, Google Scholar
• Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1): 15–33.Link, Google Scholar
• Tardella F (1990) On the equivalence between some discrete and continuous optimization problems. Ann. Oper. Res. 25(1):291–300.Crossref, Google Scholar
• Tong C, Topaloglu H (2011) On the approximate linear programming approach for network revenue management problems, INFORMS J. Comput. 26(1):121–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
• Vossen T, Zhang D (2015) A dynamic disaggregation approach to approximate linear programs for network revenue management. Production Oper. Management 24(3):488–503.Crossref, Google Scholar
• Wolsey L (1998) Integer Programming (John Wiley & Sons, New York).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
• Zhang D, Cooper WL (2005) Revenue management for parallel flights with customer-choice behavior. Oper. Res. 53(3):415–431.Link, Google Scholar