{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:29Z","timestamp":1759847729078,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:00:00Z","timestamp":1553212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10589-019-00068-y","type":"journal-article","created":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:02:51Z","timestamp":1553259771000},"page":"275-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A strong Lagrangian relaxation for general discrete-choice network revenue management"],"prefix":"10.1007","volume":"73","author":[{"given":"Sumit","family":"Kunnumkal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1608-6403","authenticated-orcid":false,"given":"Kalyan","family":"Talluri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"issue":"4","key":"68_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1287\/opre.1060.0368","volume":"55","author":"D Adelman","year":"2007","unstructured":"Adelman, D.: Dynamic bid-prices in revenue management. Oper. Res. 55(4), 647\u2013661 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"68_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/opre.2015.1459","volume":"64","author":"Aydin Alptekino\u011flu","year":"2016","unstructured":"Alptekino\u011flu, Aydin, Semple, John H.: The exponomial choice model: a new alternative for assortment and price optimization. Oper. Res. 64(1), 79\u201393 (2016)","journal-title":"Oper. Res."},{"key":"68_CR3","volume-title":"Discrete-Choice Analysis: Theory and Application to Travel Demand","author":"M Ben-Akiva","year":"1985","unstructured":"Ben-Akiva, M., Lerman, S.: Discrete-Choice Analysis: Theory and Application to Travel Demand. MIT Press, Cambridge (1985)"},{"key":"68_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"3","key":"68_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/opre.1080.0567","volume":"57","author":"JJM Bront","year":"2009","unstructured":"Bront, J.J.M., M\u00e9ndez-D\u00edaz, I., Vulcano, G.: A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3), 769\u2013784 (2009)","journal-title":"Oper. Res."},{"issue":"2","key":"68_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.ejor.2009.07.029","volume":"203","author":"L Chen","year":"2010","unstructured":"Chen, L., Homem de Mello, T.: Mathematical programming models for revenue management under customer choice. Eur. J. Oper. Res. 203(2), 294\u2013305 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Gallego, G., Iyengar, G., Phillips, R., Dubey, A.: Managing flexible products on a network. Tech. Rep. TR-2004-01, Dept of Industrial Engineering, Columbia University, NY (2004)","DOI":"10.2139\/ssrn.3567371"},{"issue":"1","key":"68_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/opre.2014.1328","volume":"63","author":"G Gallego","year":"2015","unstructured":"Gallego, G., Ratliff, R., Shebalov, S.: A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1), 212\u2013232 (2015)","journal-title":"Oper. Res."},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1086\/209225","volume":"16","author":"JR Hauser","year":"1990","unstructured":"Hauser, J.R., Wernerfelt, B.: An evaluation cost model of consideration sets. J. Consum. Res. 16, 393\u2013408 (1990)","journal-title":"J. Consum. Res."},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1037\/0022-3514.79.6.995","volume":"76","author":"SS Iyengar","year":"2000","unstructured":"Iyengar, S.S., Lepper, M.: When choice is demotivating: Can one desire too much of a good thing? J. Personal. Soc. Psychol. 76, 995\u20131006 (2000)","journal-title":"J. Personal. Soc. Psychol."},{"key":"68_CR11","unstructured":"Kunnumkal, S., Talluri, K.T.: A new compact linear programming formulation for choice network revenue management. Tech. Rep., Universitat Pompeu Fabra (2012)"},{"issue":"1","key":"68_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1287\/opre.2015.1453","volume":"64","author":"S Kunnumkal","year":"2016","unstructured":"Kunnumkal, S., Talluri, K.: Technical note\u2014a note on relaxations of the choice network revenue management dynamic program. Oper. Res. 64(1), 158\u2013166 (2016a)","journal-title":"Oper. Res."},{"issue":"1","key":"68_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1287\/moor.2015.0716","volume":"41","author":"S Kunnumkal","year":"2016","unstructured":"Kunnumkal, S., Talluri, K.T.: On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41(1), 72\u201391 (2016b)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"68_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1111\/j.1937-5956.2009.01118.x","volume":"19","author":"S Kunnumkal","year":"2010","unstructured":"Kunnumkal, S., Topaloglu, H.: A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Prod. Oper. Manag. 19(5), 575\u2013590 (2010)","journal-title":"Prod. Oper. Manag."},{"issue":"2","key":"68_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/msom.1070.0169","volume":"10","author":"Q Liu","year":"2008","unstructured":"Liu, Q., van Ryzin, G.J.: On the choice-based linear programming model for network revenue management. Manuf. Serv. Oper. Manag. 10(2), 288\u2013310 (2008)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"2","key":"68_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.ejor.2011.06.033","volume":"216","author":"J Meissner","year":"2012","unstructured":"Meissner, J., Strauss, A.K.: Network revenue management with inventory-sensitive bid prices and customer choice. Eur. J. Oper. Res. 216(2), 459\u2013468 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"68_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1111\/j.1937-5956.2012.01345.x","volume":"22","author":"J Meissner","year":"2013","unstructured":"Meissner, J., Strauss, A.K., Talluri, K.T.: An enhanced concave programming method for choice network revenue management. Prod. Oper. Manag. 22(1), 71\u201387 (2013)","journal-title":"Prod. Oper. Manag."},{"issue":"11","key":"68_CR18","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1111\/poms.12191","volume":"23","author":"P Rusmevichientong","year":"2014","unstructured":"Rusmevichientong, P., Shmoys, D., Tong, C., Topaloglu, H.: Assortment optimization under the multinomial logit model with random choice parameters. Prod. Oper. Manag. 23(11), 2023\u20132039 (2014)","journal-title":"Prod. Oper. Manag."},{"key":"68_CR19","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/0022-247X(85)90317-8","volume":"110","author":"P Schweitzer","year":"1985","unstructured":"Schweitzer, P., Seidmann, A.: Generalized polynomial approximations in markovian decision processes. J. Math. Anal. Appl. 110, 568\u2013582 (1985)","journal-title":"J. Math. Anal. Appl."},{"key":"68_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1504\/IJSTM.2001.001593","volume":"2","author":"KT Talluri","year":"2001","unstructured":"Talluri, K.T.: Airline revenue management with passenger routing control: a new model with solution approaches. Int. J. Serv. Technol. Manag. 2, 102\u2013115 (2001)","journal-title":"Int. J. Serv. Technol. Manag."},{"issue":"2","key":"68_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/ijoc.2013.0573","volume":"26","author":"KT Talluri","year":"2014","unstructured":"Talluri, K.T.: New formulations for choice network revenue management. INFORMS J. Comput. 26(2), 401\u2013413 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"68_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"KT Talluri","year":"2004","unstructured":"Talluri, K.T., van Ryzin, G.J.: Revenue management under a general discrete choice model of consumer behavior. Manag. Sci. 50(1), 15\u201333 (2004a)","journal-title":"Manag. Sci."},{"key":"68_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/b139000","volume-title":"The Theory and Practice of Revenue Management","author":"KT Talluri","year":"2004","unstructured":"Talluri, K.T., van Ryzin, G.J.: The Theory and Practice of Revenue Management. Kluwer, New York (2004b)"},{"key":"68_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1287\/opre.1080.0597","volume":"57","author":"H Topaloglu","year":"2009","unstructured":"Topaloglu, H.: Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57, 637\u2013649 (2009)","journal-title":"Oper. Res."},{"issue":"6","key":"68_CR25","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1287\/opre.2015.1442","volume":"63","author":"TWM Vossen","year":"2015","unstructured":"Vossen, T.W.M., Zhang, D.: Reductions of approximate linear program for network revenue management. Oper. Res. 63(6), 1352\u20131371 (2015)","journal-title":"Oper. Res."},{"issue":"3","key":"68_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.1090.0262","volume":"43","author":"D Zhang","year":"2009","unstructured":"Zhang, D., Adelman, D.: An approximate dynamic programming approach to network revenue management with customer choice. Transp. Sci. 43(3), 381\u2013394 (2009)","journal-title":"Transp. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00068-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T22:10:18Z","timestamp":1606947018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00068-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,22]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00068-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,3,22]]},"assertion":[{"value":"19 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}