A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems

Published Online:https://doi.org/10.1287/ijoc.1080.0269

References

  • Adelman D. Dynamic bid-prices in revenue management. Oper. Res. (2007) 55:647–661LinkGoogle Scholar
  • Bashyam S., Fu M. C. Optimizaton of (s,S) inventory systems with random lead times and a service level constraint. Management Sci. (1998) 44:243–256LinkGoogle Scholar
  • Bertsekas D. P., Tsitsiklis J. M.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Bertsimas D., de Boer S. Simulation-based booking limits for airline revenue management. Oper. Res. (2005) 53:90–106LinkGoogle Scholar
  • Bertsimas D., Popescu I. Revenue management in a dynamic network environment. Transportation Sci. (2003) 37:257–277LinkGoogle Scholar
  • Fu M. Sample path derivatives for (s,S) inventory systems. Oper. Res. (1994) 42:351–363LinkGoogle Scholar
  • Glasserman P., Tayur S. Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. (1995) 41:263–281LinkGoogle Scholar
  • Karaesmen I., van Ryzin G. Overbooking with substitutable inventory classes. Oper. Res. (2004) 52:83–104LinkGoogle Scholar
  • Kunnumkal S., Topaloglu H. Using stochastic approximation algorithms to compute optimal base-stock levels in inventory control problems. Oper. Res. (2007) . ForthcomingGoogle Scholar
  • Kushner H. J., Clark D. S.Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • L'Ecuyer P., Glynn P. Stochastic optimization by simulation: Convergence proofs for the GI/G/1 queue in steady state. Management Sci. (1994) 40:1245–1261LinkGoogle Scholar
  • Mahajan S., van Ryzin G. Stocking retail assortments under dynamic customer substitution. Oper. Res. (2001) 49:334–351LinkGoogle Scholar
  • Simpson R. W. Using network flow techniques to find shadow prices for market and seat inventory control. (1989) . Technical report, MIT Flight Transportation Laboratory Memorandum M89-1, Massachusetts Institute of Technology, CambridgeGoogle Scholar
  • Talluri K., van Ryzin G. An analysis of bid-price controls for network revenue management. Management Sci. (1998) 44:1577–1593LinkGoogle Scholar
  • Talluri K., van Ryzin G. A randomized linear programming method for computing network bid prices. Transportation Sci. (1999) 33:207–216LinkGoogle Scholar
  • Talluri K. T., van Ryzin G. J.The Theory and Practice of Revenue Management (2004) (Kluwer Academic Publishers, Boston) CrossrefGoogle Scholar
  • Topaloglu H. Using Lagrangian relaxation to compute capacity-dependent bid-prices in network revenue management. Oper. Res. (2008) . ForthcomingGoogle Scholar
  • van Ryzin G., McGill J. Revenue management without forecasting or optimization: An adaptive algorithm for determining airline seat protection levels. Management Sci. (2000) 46:760–775LinkGoogle Scholar
  • van Ryzin G., Vulcano G. Computing virtual nesting controls for network revenue management under customer choice behavior. (2004) . Technical Report DRO-2004-09, Columbia Business School, New YorkGoogle Scholar
  • van Ryzin G., Vulcano G. Simulation-based optimization of virtual nesting controls for network revenue management. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • Williamson E. L. Airline network seat control. (1992) . Ph.D. thesis, Massachusetts Institute of Technology, CambridgeGoogle 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.