A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice

Published Online:https://doi.org/10.1287/moor.1120.0537

References

  • Adelman D. Dynamic bid prices in revenue management. Oper. Res. (2007) 55(4):647–661LinkGoogle Scholar
  • Bertsimas D., Tsitsiklis J. N.Introduction to Linear Optimization (1997) (Athena Scientific, Belmont, Massachusetts) Google Scholar
  • Chaneton J. M., Vulcano G. Computing bid-prices for revenue management under customer choice behavior. Manufacturing Service Oper. Management (2011) 13(4):452–470LinkGoogle Scholar
  • Chen L., Homem-de-Mello T. Re-solving stochastic programming models for airline revenue management. (2006) . Working Paper 04-012, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, www.optimization-online.orgGoogle Scholar
  • Cooper W. L. Asymptotic behavior of an allocation policy for revenue management. Oper. Res. (2002) 50(4):720–727LinkGoogle Scholar
  • Farias V. F., Van Roy B. An approximate dynamic programming approach to network revenue management. (2007) . http://web.mit.edu/~vivekf/www/papers/ADP-rm.pdfGoogle Scholar
  • Jasin S., Kumar S.Implementing Deterministic-Linear-Program-Based Heuristics in Network Revenue Management (2011) . Under second revision for Oper. Res.Google Scholar
  • Kunnumkal S., Topaloglu H. A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management (2010) 19(5):575–590CrossrefGoogle Scholar
  • Liu Q., van Ryzin G. J. On the choice-based linear programming model for network revenue management. Manufacturing and Service Oper. Management (2008) 10(2):288–310LinkGoogle Scholar
  • Maglaras C., Meissner J. Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing and Service Oper. Management (2006) 8(2):136–148LinkGoogle Scholar
  • Meissner J., Strauss A. K. Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res (2012) 216(2):459–468CrossrefGoogle Scholar
  • Reiman M. I., Wang Q. An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. (2008) 33(2):257–282LinkGoogle Scholar
  • Secomandi N. An analysis of the control-algorithm re-solving issue in inventory and revenue management. Manufacturing Service Oper. Management (2008) 10(3):468–483LinkGoogle Scholar
  • Talluri K., van Ryzin G. Revenue management under a general discrete choice model of consumer behavior. Management Sci. (2004a) 50(1):15–33LinkGoogle Scholar
  • Talluri K., van Ryzin G.The Theory and Practice of Revenue Management (2004b) (Springer, New York) CrossrefGoogle Scholar
  • Williams D.Probability with Martingales (2010) (Cambridge University Press, New York) Google Scholar
  • Zhang D., Adelman D. An approximate dynamic programming approach to network revenue management with customer choice. Trans. Sci. (2009) 43(3):381–394LinkGoogle 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.