Network revenue management with inventory-sensitive bid prices and customer choice

European Journal of Operational Research

Volumn 216, Issue 2, 2012, Pages 459-468

  Meissner, Joern ^a   Strauss, Arne ^b  

^a KÜHNE LOGISTICS UNIVERSITY   (Germany)

^b LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

Applications; Approximate; Dynamic programming optimal control:; Revenue management

Indexed keywords

APPLICATIONS; MARKOV PROCESSES;

APPROXIMATE; APPROXIMATE DYNAMIC PROGRAMMING; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL WORKLOAD; DYNAMIC PROGRAMMING/OPTIMAL CONTROL; MARKOV DECISION PROCESSES; NETWORK REVENUE MANAGEMENTS; REVENUE MANAGEMENT;

DYNAMIC PROGRAMMING;

EID: 80755154734     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.06.033     Document Type: Article

References (33)

1. Adelman, D., 2007. Dynamic bid prices in revenue management. Operations Research 55, 647-661.
2. Belobaba, P. P., Hopperstad, C, 1999. Boeing/MIT simulation study: PODS results update. In: 1999 AGIFORS Reservations and Yield Management Study Group Symposium Proceedings.
3. Belobaba, P. P., Weatherford, L. R., 1996. Comparing decision rules that incorporate customer diversion in perishable asset revenue management situations. Decision Sciences 27(2), 343-363.
4. Bertsekas, D. P., Tsitsiklis, J. N., 1996. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
5. Boyd, E. A., Kallesen, R., 2004. The science of revenue management when passengers purchase the lowest available fare. Journal of Revenue and Pricing Management 3, 2.
6. Boyd, S. P., Vandenberghe, L, 2004. Convex Optimization. Cambridge University Press.
7. Brumelle, S., McGill, J., Oum, T., Sawaki, K., Tretheway, M., 1990. Allocation of airline seats between stochastically dependent demands. Transportation Science 24, 183-192.
8. Camm, J., Raturi, A., Tsubakitani, S., 1990. Cutting Big M down to size. Interfaces 20, 61-66.
9. Chen, L., de Mello, T. H., 2010. Mathematical programming models for revenue management under customer choice. European Journal of Operational Research 203, 294-305.
10. Chiang, W.-C., Chen, J. C. H., Xu, X., 2007. An overview of research revenue management: current issues and future research. International Journal of Revenue Management 1, 97-128.
11. de Farias, D., Van Roy, B., 2003. The linear programming approach to approximate dynamic programming. Operations Research 51, 850-865.
12. de Farias, D. P., Van Roy, B., 2004. On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research 29, 462-478.
13. Farias, V. F., Van Roy, B., 2007. An approximate dynamic programming approach to network revenue management, working paper. URL .
14. Gallego, G., Iyengar, G., Phillips, R., Dubey, A., 2004. Managing flexible products on a network. Technical Report TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University.
15. Kunnumkal, S., Topaloglu, H., 2008. A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Research Logistics 55, 563-580.
16. Liu, Q., van Ryzin, G. J., 2008. On the choice-based linear programming model for network revenue management. Manufacturing & Service Operations Management (10), 288-311.
17. McGill, J., van Ryzin, G., 1999. Revenue management: research overview and prospects. Transportation Science 33, 233-256.
18. Meissner, J., Strauss, A., 2009. Choice-based network revenue management under weak market segmentation, Working Paper, Lancaster University Management School.
19. Meissner, J., Strauss, A., Talluri, K., 2011. An enhanced concave program relaxation for choice network revenue management, working Paper.
20. Miranda Bront, J. J., Méndez-Díaz, I., Vulcano, G., 2009. A column generation algorithm for choice-based network revenue management. Operations Research 57, 769-784 .
21. Powell, W., 2007. Approximate Dynamic Programming. John Wiley & Sons, Hoboken, NJ.
22. Siddappa, S., Günther, D., Rosenberger, J., Chen, V., 2007. Refined experimental design and regression splines method for network revenue management. Journal of Revenue and Pricing Management 6, 188-199.
23. Talluri, K., 2008. On bounds for network revenue management, working Paper, Universitat Pompeu Fabra.
24. Talluri, K., April 2010. A randomized concave programming method for choice network revenue management, working Paper.
25. Talluri, K., van Ryzin, G., 1999. A randomized linear programming method for computing network bid prices. Transportation Science 33, 207-216.
26. Talluri, K., van Ryzin, G. J., 2004a. Revenue management under a general discrete choice model of consumer behavior. Management Science 50, 15-33.
27. Talluri, K., van Ryzin, G. J., 2004b. The Theory and Practice of Revenue Management. Springer, New York.
28. Topaloglu, H., 2009. Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Operations Research 57, 637-649.
29. van Ryzin, G. J., 2005. Models of demand. Journal of Revenue and Pricing Management 4, 204-210.
30. van Ryzin, G. J., Vulcano, G., 2008. Computing virtual nesting controls for network revenue management under customer choice behavior. Manufacturing & Service Operations Management 10, 448-467.
31. Zhang, D., Adelman, D., 2009. An approximate dynamic programming approach to network revenue management with customer choice. Transportation Science 43, 381-394.
32. Zhang, D., Cooper, W., 2005. Revenue management for parallel flights with customer choice behavior. Operations Research 53, 415-431.
33. Zhang, D., Cooper, W., 2009. Pricing substitutable flights in airline revenue management. European Journal of Operational Research 197, 848-861.