Randomization approaches for network revenue management with customer choice behavior

Production and Operations Management

Volumn 23, Issue 9, 2014, Pages 1617-1633

  Kunnumkal, Sumit ^a  

^a INDIAN SCHOOL OF BUSINESS   (India)

Author keywords

customer choice; dynamic programming; network revenue management; simulation

Indexed keywords

EID: 84908136551     PISSN: 10591478     EISSN: 19375956     Source Type: Journal    
DOI: 10.1111/poms.12164     Document Type: Article

References (25)

1. Ben-Akiva, M., S. Lerman,. 1994. Discrete Choice Analysis: Theory and Applications to Travel Demand. The MIT Press, Cambridge, MA.
2. Bront, J. J. M., I. Mendez-Diaz, G. Vulcano,. 2009. A column generation algorithm for choice-based network revenue management. Oper. Res. 57: 769-784.
3. Chaneton, J., G. Vulcano,. 2011. Computing bid-prices for revenue management under customer choice behavior. M&SOM 13 (4): 452-470.
4. Cooper, W. L., 2002. Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50 (4): 720-727.
5. Farias, V., S. Jagabathula, D. Shah,. 2013. A non-parametric approach to modeling choice with limited data. Manage. Sci. 3 (2): 305-322.
6. Gallego, G., R. Ratliff, S. Shebalov,. 2011. A general attraction model and an efficient formulation for the network revenue management problem. Working paper, Columbia University, New York.
7. Kleywegt, A. J., A. Shapiro, T. Homem-De-Mello,. 2002. The sample average approximation method for stochastic discrete optimization. SIAM J. Optimization 12: 479-502.
8. Kunnumkal, S., H. Topaloglu,. 2010a. Computing time-dependent bid prices in network revenue management problems. Transport. Sci. 44 (1): 38-62.
9. Kunnumkal, S., H. Topaloglu,. 2010b. A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Prod. Oper. Manag. 19 (5): 575-590.
10. Liu, Q., G. van Ryzin,. 2008. On the choice-based linear programming model for network revenue management. M&SOM 10 (2): 288-310.
11. Mahajan, S., G. van Ryzin,. 2001. Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49 (3): 334-351.
12. Meissner, J., A. K. Strauss,. 2011. Choice-based network revenue management under weak market segmentation. Working paper, Department of Management Science, Lancaster University, Lancaster.
13. Meissner, J., A. K. Strauss,. 2012a. Improved bid prices for choice-based network revenue management. Eur. J. Oper. Res. 217 (2): 417-422.
14. Meissner, J., A. K. Strauss,. 2012b. Network revenue management with inventory sensitive bid prices and customer choice. Eur. J. Oper. Res. 216 (2): 459-468.
15. Meissner, J., A. K. Strauss, K. Talluri,. 2013. An enhanced concave program relaxation for choice network revenue management. Prod. Oper. Manag. 22 (1): 71-87.
16. Mendez-Diaz, I., J. Miranda-Bront, G. Vulcano, P. Zabala,. 2011. A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. (forthcoming).
17. van Ryzin, G., G. Vulcano,. 2008. Computing virtual nesting controls for network revenue management under customer choice behavior. M&SOM 10: 448-467.
18. van Ryzin, G., G. Vulcano,. 2011. An expectation-maximization algorithm to estimate a general class of non-parametric choice models Working paper, New York University, New York.
19. Talluri, K., 2011. A randomized concave programming method for choice network revenue management. Working paper, Universitat Pompeu Fabra, Barcelona, Spain.
20. Talluri, K., G. van Ryzin,. 1999. A randomized linear programming method for computing network bid prices. Transport. Sci. 33 (2): 207-216.
21. Talluri, K., G. van Ryzin,. 2004. The Theory and Practice of Revenue Management, Kluwer Academic Press, Norwell, MA.
22. Vossen, T., D. Zhang,. 2013. A dynamic disaggregation approach to approximate linear programs for network revenue management Working paper, University of Colorado at Boulder, Boulder.
23. Zhang, D., 2011. An improved dynamic programming decomposition approach for network revenue management. M&SOM 13: 35-52.
24. Zhang, D., D. Adelman,. 2009. An approximate dynamic programming approach to network revenue management with customer choice. Transport. Sci. 43: 381-394.
25. Zhang, D., W. L. Cooper,. 2005. Revenue management for parallel flights with customer-choice behavior. Oper. Res., 53: 415-431.