Dynamic Basis Function Generation 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, Klabjan D (2012) Computing near-optimal policies in generalized joint replenishment. INFORMS J. Comput. 24(1):148–164.Link, Google Scholar
• Adelman D, Barz C, Olivares-Nadal AV (2025a) Dynamic basis function generation for network revenue management. Preprint, submitted February 25, https://arxiv.org/abs/2502.16830.Google Scholar
• Adelman D, Barz C, Olivares-Nadal AV (2025b) Dynamic basis function generation for network revenue management. https://doi.org/10.1287/ijoc.2023.0418.cd, https://github.com/INFORMSJoC/2023.0418.Google Scholar
• Barz C, Kolisch R (2014) Hierarchical multi-skill resource assignment in the telecommunications industry. Production Oper. Management 23(3):489–503.Crossref, Google Scholar
• Bellman R (1966) Dynamic programming. Science (1979) 153(3731):34–37.Google Scholar
• Bertsekas D (2012) Dynamic Programming and Optimal Control, vol. II, 4th ed. (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
• Bhat N, Farias V, Moallemi CC, Zheng AT (2023) Nonparametric approximate dynamic programming via the kernel method. Stochastic Systems 13(3):321–342.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
• Farias VF, Van Roy B (2007) An approximate dynamic programming approach to network revenue management. Technical report, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Guestrin C, Koller D, Parr R, Venkataraman S (2003) Efficient solution algorithms for factored mdps. J. Artificial Intelligence Res. 19:399–468.Crossref, Google Scholar
• Hernández-Lerma O, Lasserre JB (1996) Discrete-Time Markov Control Processes: Basic Optimality Criteria, vol. 30 (Springer Science & Business Media, New York).Crossref, Google Scholar
• Klabjan D, Adelman D (2007) An infinite-dimensional linear programming algorithm for deterministic semi-Markov decision processes on Borel spaces. Math. Oper. Res. 32(3):528–550.Link, Google Scholar
• Laumer S, Barz C (2023a) Reductions of non-separable approximate linear programs for network revenue management. Eur. J. Oper. Res. 309(1):252–270.Crossref, Google Scholar
• Laumer S, Barz C (2023b) Reductions of non-separable approximate linear programs for network revenue management. https://github.com/slaume/Reductions-of-Non-Separable-ALPs-for-NRM.Google Scholar
• Pakiman P, Nadarajah S, Soheili N, Lin Q (2024) Self-guided approximate linear programs: Randomized multi-shot approximation of discounted cost Markov decision processes. Management Sci. 71(4):3384–3404.Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Samiedaluie S, Zhang D, Zhang R (2024) Approximate linear programming for a queueing control problem. Comput. Oper. Res. 169:106711.Crossref, Google Scholar
• Schweitzer PJ, Seidmann A (1985) Generalized polynomial approximations in markovian decision processes. J. Math. Analysis Appl. 110(2):568–582.Crossref, Google Scholar
• Sun X, Cheney EW (1992) The fundamentality of sets of ridge functions. Aequationae Math. 44(2–3):226–235.Crossref, Google Scholar
• Talluri KT, Van Ryzin G (2004) The Theory and Practice of Revenue Management, vol. 1 (Springer, New York).Crossref, Google Scholar
• Tong C, Topaloglu H (2013) 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 TW, Zhang D (2015a) A dynamic disaggregation approach to approximate linear programs for network revenue management. Production Oper. Management 24(3):469–487.Crossref, Google Scholar
• Vossen TW, Zhang D (2015b) Reductions of approximate linear programs for network revenue management. Oper. Res. 63(6):1352–1371.Link, Google Scholar
• Zhang D (2011) An improved dynamic programming decomposition approach for network revenue management. Manufacturing Service Oper. Management 13(1):35–52.Link, Google Scholar