Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals

References

• Adelman D (2007) Dynamic bid prices in revenue management. Oper. Res. 55(4):647–661.Link, Google Scholar
• Aouad A, Farias V, Levi R (2020) Assortment optimization under consider-then-choose choice models. Management Sci. 67(6):3368–3386.Link, Google Scholar
• Baek J, Ma W (2021) Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Technical report, Columbia University, New York.Google Scholar
• Bertsimas D, Popescu I (2003) Revenue management in a dynamic network environment. Transportation Sci. 37(3):257–277.Link, Google Scholar
• Bertsekas DP (2012) Dynamic Programming and Optimal Control, vol. 2, 4th ed. (Athena Scientific, Belmont, MA).Google Scholar
• Bertsekas DP (2017) Dynamic Programming and Optimal Control, vol. 1, 4th ed. (Athena Scientific, Belmont, MA).Google Scholar
• Bertsekas DP, Castanon DA (1999) Rollout algorithms for stochastic scheduling problems. J. Heuristics 5(1):89–108.Crossref, Google Scholar
• Bertsekas DP, Tsitsiklis JN, Wu C (1997) Rollout algorithms for combinatorial optimization. J. Heuristics 3(3):245–262.Crossref, Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Boutique Homes (2020) Boutique homes: Very small hotels. Accessed December 8, 2020, https://www.boutique-homes.com/small-hotels/.Google Scholar
• Bront JJM, Mendez Diaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
• Cao Y, Rusmevichientong P, Topaloglu H (2020) Revenue management under a mixture of multinomial logit and independent demand models. Technical report, Cornell University, New York).Google Scholar
• Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.Link, Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Preprint, submitted April 27, https://dx.doi.org/10.2139/ssrn.3567371.Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Kirshner SN, Nediak M (2015) Scalable dynamic bid prices for network revenue management in continuous time. Production Oper. Management 24(10):1621–1635.Crossref, Google Scholar
• Kunnumkal S, Talluri K (2016a) On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41(1):72–91.Link, Google Scholar
• Kunnumkal S, Talluri K (2016b) Technical note: A note on relaxations of choice network revenue management dynamic program. Oper. Res. 64(1):158–166.Link, Google Scholar
• Kunnumkal S, Topaloglu H (2008) A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. 55(6):563–580.Crossref, 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
• Ma Y, Rusmevichientong P, Sumida M, Topaloglu H (2020) An approximation algorithm for network revenue management under nonstationary arrivals. Oper. Res. 68(3):834–855.Link, Google Scholar
• Manshadi V, Rodilitz S (2022) Efficient policies for efficient volunteer crowdsourcing. Management Sci. 68(9):6572–6590.Link, Google Scholar
• Meissner J, Strauss A, Talluri K (2012) An enhanced concave program relaxation for choice network revenue management. Production Oper. Management 22(1):71–87.Crossref, Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random use durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796–802.Link, Google Scholar
• Talluri K, van Ryzin GJ (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11-part-1):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
• 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
• Villa Mahal (2020) Villa Mahal Hotel website. Accessed December 8, 2020, https://www.villamahal.com.Google Scholar
• Vossen TWM, 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 TWM, Zhang D (2015b) Reductions of approximate linear programs 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
• Zhang D, Cooper WL (2005) Revenue management for parallel flights with customer choice behavior. Oper. Res. 53(3):415–431.Link, Google Scholar
• Zhang D, Cooper WL (2009) Pricing substitutable flights in airline revenue management. Eur. J. Oper. Res. 197(3):848–861.Crossref, Google Scholar