A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem
Authors:
- Kuancheng HuangKHKuancheng Huang
- 1 May 2011
- journal article
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 47 (3) , 333-341
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An approximate algorithm for the two-dimensional air cargo revenue management problemTransportation Research Part E: Logistics and Transportation Review, 2010
- Computing Time-Dependent Bid Prices in Network Revenue Management ProblemsTransportation Science, 2010
- On the asymptotic optimality of the randomized linear program for network revenue managementEuropean Journal of Operational Research, 2009
- Computing protection level policies for dynamic capacity allocation problems by using stochastic approximation methodsIIE Transactions, 2009
- A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management ProblemsINFORMS Journal on Computing, 2008
- Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue ManagementOperations Research, 2008
- Dynamic Bid Prices in Revenue ManagementOperations Research, 2007
- Network capacity control using self-adjusting bid-pricesOR Spectrum, 2006
- Revenue Management in a Dynamic Network EnvironmentTransportation Science, 2003
- An Analysis of Bid-Price Controls for Network Revenue ManagementManagement Science, 1998