A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
Published Online:12 Jun 2008https://doi.org/10.1287/ijoc.1080.0269
References
- Dynamic bid-prices in revenue management. Oper. Res. (2007) 55:647–661Link, Google Scholar
- Optimizaton of (s,S) inventory systems with random lead times and a service level constraint. Management Sci. (1998) 44:243–256Link, Google Scholar
- Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
- Simulation-based booking limits for airline revenue management. Oper. Res. (2005) 53:90–106Link, Google Scholar
- Revenue management in a dynamic network environment. Transportation Sci. (2003) 37:257–277Link, Google Scholar
- Sample path derivatives for (s,S) inventory systems. Oper. Res. (1994) 42:351–363Link, Google Scholar
- Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Sci. (1995) 41:263–281Link, Google Scholar
- Overbooking with substitutable inventory classes. Oper. Res. (2004) 52:83–104Link, Google Scholar
- Using stochastic approximation algorithms to compute optimal base-stock levels in inventory control problems. Oper. Res. (2007) . ForthcomingGoogle Scholar
- Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978) (Springer-Verlag, Berlin) Crossref, Google Scholar
- Stochastic optimization by simulation: Convergence proofs for the GI/G/1 queue in steady state. Management Sci. (1994) 40:1245–1261Link, Google Scholar
- Stocking retail assortments under dynamic customer substitution. Oper. Res. (2001) 49:334–351Link, Google Scholar
- 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
- An analysis of bid-price controls for network revenue management. Management Sci. (1998) 44:1577–1593Link, Google Scholar
- A randomized linear programming method for computing network bid prices. Transportation Sci. (1999) 33:207–216Link, Google Scholar
- The Theory and Practice of Revenue Management (2004) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
- Using Lagrangian relaxation to compute capacity-dependent bid-prices in network revenue management. Oper. Res. (2008) . ForthcomingGoogle Scholar
- Revenue management without forecasting or optimization: An adaptive algorithm for determining airline seat protection levels. Management Sci. (2000) 46:760–775Link, Google Scholar
- Computing virtual nesting controls for network revenue management under customer choice behavior. (2004) . Technical Report DRO-2004-09, Columbia Business School, New YorkGoogle Scholar
- Simulation-based optimization of virtual nesting controls for network revenue management. Oper. Res. (2006) . ForthcomingGoogle Scholar
- Airline network seat control. (1992) . Ph.D. thesis, Massachusetts Institute of Technology, CambridgeGoogle Scholar

