Computing Time-Dependent Bid Prices in Network Revenue Management Problems

References

• Adelman D. Dynamic bid prices in revenue management. Oper. Res. (2007) 55(4):647–661Link, Google Scholar
• Adelman D., Mersereau A. J. Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. (2008) 56(3):712–727Link, Google Scholar
• Belobaba P. P. Air travel demand and airline seat inventory control. (1987) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Bertsekas D. P.Dynamic Programming and Optimal Control (2001) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsimas D., Popescu I. Revenue management in a dynamic network environment. Transportation Sci. (2003) 37:257–277Link, Google Scholar
• Castanon D. A. Approximate dynamic programming for sensor management. Proc. 36th Conf. Decision Control (1997) (Institute of Electrical and Electronics Engineers, San Diego) Crossref, Google Scholar
• Cheung R. K., Powell W. B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. (1996) 44(6):951–963Link, Google Scholar
• Cooper W. L. Asymptotic behavior of an allocation policy for revenue management. Oper. Res. (2002) 50(4):720–727Link, Google Scholar
• Gallego G., Iyengar G., Phillips R., Dubey A. Managing flexible products on a network. (2004) . Technical report TR-2004-01, Computational Optimization Research Center, Columbia University, New York. http://corc.ieor.columbia.edu/reports/techreports.htmlGoogle Scholar
• Hawkins J. A Lagrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. (2003) . Unpublished doctoral dissertation, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Karmarkar U. S. The multiperiod multilocation inventory problems. Oper. Res. (1981) 29:215–228Link, Google Scholar
• Kunnumkal S., Topaloglu H. A duality-based relaxation and decomposition approach for inventory distribution systems. Naval Res. Logist. Quart. (2008a) 55(7):612–631Crossref, Google Scholar
• Kunnumkal S., Topaloglu H. A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. Quart. (2008b) 55:563–580Crossref, 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. (2009) . ForthcomingGoogle Scholar
• Law A. L., Kelton W. D.Simulation Modeling and Analysis (2000) (McGraw-Hill, Boston) Google Scholar
• Liu Q., van Ryzin G. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management (2008) 10(2):288–310Link, Google Scholar
• Ruszczynski A., Ruszczynski A., Shapiro A. Decomposition methods. Handbook in Operations Research and Management Science, Vol. 10, Stochastic Programming (2003) (North Holland, Amsterdam) Crossref, Google Scholar
• Simpson R. W. Using network flow techniques to find shadow prices for market and seat inventory control. (1989) . Technical report, Massachusetts Institute of Technology Flight Transportation Laboratory Memorandum M89-1, Cambridge, MAGoogle Scholar
• Talluri K., van Ryzin G. An analysis of bid-price controls for network revenue management. Management Sci. (1998) 44(11):1577–1593Link, Google Scholar
• Talluri K., van Ryzin G. A randomized linear programming method for computing network bid prices. Transportation Sci. (1999) 33(2):207–216Link, Google Scholar
• Talluri K. T., van Ryzin G. J.The Theory and Practice of Revenue Management (2004) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Topaloglu H. Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. (2009) 57(3):637–649Link, Google Scholar
• Topaloglu H., Kunnumkal S. Computing time-dependent bid prices in network revenue management problems. (2006) . Technical report, Cornell University, School of Operations Research and Information Engineering, Ithaca, NY. http://legacy.orie.cornell.edu/∼huseyin/publications/publications.htmlGoogle Scholar
• Varaiya P. P. Lecture notes on optimization. (1998) . Unpublished manuscript, University of California, Department of Electrical Engineering and Computer Science. http://paleale.eecs.berkeley.edu/∼varaiya/papers_ps.dir.NOO.pdfGoogle Scholar
• Williamson E. L. Airline network seat control. (1992) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, Inc., New York) Google Scholar
• Zhang D., Adelman D. An approximate dynamic programming approach to network revenue management with customer choice. (2006) . Technical report, University of Chicago, Graduate School of Business, ChicagoGoogle Scholar