{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T16:18:05Z","timestamp":1773332285327,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10898-022-01131-5","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T05:03:41Z","timestamp":1643605421000},"page":"77-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fractional 0\u20131 programming and submodularity"],"prefix":"10.1007","volume":"84","author":[{"given":"Shaoning","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2888-8630","authenticated-orcid":false,"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"issue":"1\u20132","key":"1131_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1\u20132), 149\u2013169 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"1131_CR2","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ejor.2020.12.007","volume":"291","author":"L Alfandari","year":"2021","unstructured":"Alfandari, L., Hassanzadeh, A., Ljubi\u0107, I.: An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291(3), 830\u2013845 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1131_CR3","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/S0377-2217(97)00401-3","volume":"112","author":"A Amiri","year":"1999","unstructured":"Amiri, A., Rolland, E., Barkhi, R.: Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. Eur. J. Oper. Res. 112(3), 635\u2013645 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"1131_CR4","first-page":"578","volume":"8","author":"S Arora","year":"1977","unstructured":"Arora, S., Puri, M., Swarup, K.: The set covering problem with linear fractional functional. Indian J. Pure Appl. Math. 8(5), 578\u2013588 (1977)","journal-title":"Indian J. Pure Appl. Math."},{"issue":"2","key":"1131_CR5","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.1110.1037","volume":"60","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Berenguer, G., Shen, Z.-J.: A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60(2), 366\u2013381 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"1131_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/opre.2016.1570","volume":"65","author":"A Atamt\u00fcrk","year":"2017","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Maximizing a class of utility functions over the vertices of a polytope. Oper. Res. 65(2), 433\u2013445 (2017)","journal-title":"Oper. Res."},{"issue":"2","key":"1131_CR7","first-page":"609","volume":"68","author":"A Atamt\u00fcrk","year":"2020","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Submodularity in conic quadratic mixed 0\u20131 optimization. Oper. Res. 68(2), 609\u2013630 (2020)","journal-title":"Oper. Res."},{"issue":"5","key":"1131_CR8","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5), 618\u2013622 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1131_CR9","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Submodular function minimization and polarity. Math. Program. 1\u201311 (2021)","DOI":"10.1007\/s10107-020-01607-w"},{"key":"1131_CR10","unstructured":"Barros, A.I.: Discrete and Fractional Programming Techniques for Location Models, vol.\u00a03. Springer Science & Business Media (2013)"},{"key":"1131_CR11","unstructured":"Benati, S.: Submodularity in competitive location problems. Ricerca Oper. (1996)"},{"issue":"3","key":"1131_CR12","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","volume":"143","author":"S Benati","year":"2002","unstructured":"Benati, S., Hansen, P.: The maximum capture problem with random utilities: problem formulation and algorithms. Eur. J. Oper. Res. 143(3), 518\u2013530 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"1131_CR13","doi-asserted-by":"crossref","unstructured":"Berbeglia, G., Joret, G.: Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC \u201917, pp. 345\u2013346. New York, NY, USA. ACM (2017)","DOI":"10.1145\/3033274.3084084"},{"issue":"3","key":"1131_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1287\/ijoo.2018.0006","volume":"1","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Korolko, N., Weinstein, A.M.: Identifying exceptional responders in randomized trials: an optimization approach. INFORMS J. Optim. 1(3), 187\u2013199 (2019)","journal-title":"INFORMS J. Optim."},{"issue":"4","key":"1131_CR15","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1093\/erae\/28.4.433","volume":"28","author":"C Bonnet","year":"2001","unstructured":"Bonnet, C., Simioni, M.: Assessing consumer response to protected designation of origin labelling: a mixed multinomial logit approach. Eur. Rev. Agric. Econ. 28(4), 433\u2013449 (2001)","journal-title":"Eur. Rev. Agric. Econ."},{"issue":"4","key":"1131_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.orl.2016.03.015","volume":"44","author":"JS Borrero","year":"2016","unstructured":"Borrero, J.S., Gillen, C., Prokopyev, O.A.: A simple technique to improve linearized reformulations of fractional (hyperbolic) 0\u20131 programming problems. Oper. Res. Lett. 44(4), 479\u2013486 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1131_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10898-016-0487-4","volume":"69","author":"JS Borrero","year":"2017","unstructured":"Borrero, J.S., Gillen, C., Prokopyev, O.A.: Fractional 0\u20131 programming: applications and algorithms. J. Global Optim. 69(1), 255\u2013282 (2017)","journal-title":"J. Global Optim."},{"issue":"6","key":"1131_CR18","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1131_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230070405","volume":"7","author":"R Chandrasekaran","year":"1977","unstructured":"Chandrasekaran, R.: Minimal ratio spanning trees. Networks 7(4), 335\u2013342 (1977)","journal-title":"Networks"},{"key":"1131_CR20","doi-asserted-by":"crossref","unstructured":"Dam, T.T., Ta, T.A., Mai, T.: Submodularity and local search approaches for maximum capture problems under generalized extreme value models. Eur. J. Oper. Res. (2021)","DOI":"10.1016\/j.ejor.2021.09.006"},{"key":"1131_CR21","doi-asserted-by":"crossref","unstructured":"D\u00e9sir, A., Goyal, V., Segev, D., Ye, C.: Capacity constrained assortment optimization under the Markov chain based choice model. Working paper, Columbia University, New York, NY (2015). http:\/\/dx.doi.org\/10.2139\/ssrn.2626484","DOI":"10.2139\/ssrn.2626484"},{"key":"1131_CR22","doi-asserted-by":"crossref","unstructured":"D\u00e9sir, A., Goyal, V., Zhang, J.: Near-optimal algorithms for capacity constrained assortment optimization. Working paper, Columbia University, NY (2014). http:\/\/dx.doi.org\/10.2139\/ssrn.2543309","DOI":"10.2139\/ssrn.2543309"},{"issue":"1\u20132","key":"1131_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1\u20132), 191\u2013200 (2012)","journal-title":"Algorithmica"},{"issue":"6","key":"1131_CR24","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S.: Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6), 615\u2013624 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"1131_CR25","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1111\/poms.12365","volume":"24","author":"J Feldman","year":"2015","unstructured":"Feldman, J., Topaloglu, H.: Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Prod. Oper. Manag. 24(10), 1598\u20131620 (2015)","journal-title":"Prod. Oper. Manag."},{"key":"1131_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume-title":"Polyhedral Combinatorics","author":"ML Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u2013II. In: Balinski, M.L., Hoffman, A.J. (eds.) Polyhedral Combinatorics, pp. 73\u201387. Springer, Berlin (1978)"},{"key":"1131_CR27","unstructured":"Goldstein, M.: Meet the most crowded airlines: Load factor hits all-time high (2018). https:\/\/www.forbes.com\/sites\/michaelgoldstein\/2018\/07\/09\/meet-the-most-crowded-airlines-load-factor-hits-all-time-high\/#90f0b4354fbd. Accessed 12 April 2019 (Forbes)"},{"key":"1131_CR28","doi-asserted-by":"crossref","unstructured":"Granot, D., Granot, F.: On solving fractional (0, 1) programs by implicit enumeration. INFOR Inform. Syst. Oper. Res. 14(3), 241\u2013249 (1976)","DOI":"10.1080\/03155986.1976.11731643"},{"issue":"1\u20134","key":"1131_CR29","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01531072","volume":"1","author":"P Hansen","year":"1990","unstructured":"Hansen, P., De Arag\u00e3o, M.V.P., Ribeiro, C.C.: Boolean query optimization and the 0\u20131 hyperbolic sum problem. Ann. Math. Artif. Intell. 1(1\u20134), 97\u2013109 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20133","key":"1131_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01582890","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., De Arag\u00e3o, M.V.P., Ribeiro, C.C.: Hyperbolic 0\u20131 programming and query optimization in information retrieval. Math. Program. 52(1\u20133), 255\u2013263 (1991)","journal-title":"Math. Program."},{"key":"1131_CR31","unstructured":"Hoisington, A.: Hotel Management (2018). https:\/\/www.hotelmanagement.net\/own\/occupancy-hits-30-year-high-u-s. Accessed 12 April 2019"},{"issue":"3","key":"1131_CR32","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01240735","volume":"11","author":"K Iwano","year":"1994","unstructured":"Iwano, K., Misono, S., Tezuka, S., Fujishige, S.: A new scaling algorithm for the maximum mean cut problem. Algorithmica 11(3), 243\u2013255 (1994)","journal-title":"Algorithmica"},{"key":"1131_CR33","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: Mathieu, C. (ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 545\u2013554. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.60"},{"issue":"2","key":"1131_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.orl.2015.01.010","volume":"43","author":"S Kunnumkal","year":"2015","unstructured":"Kunnumkal, S.: On upper bounds for assortment optimization under the mixture of multinomial logit models. Oper. Res. Lett. 43(2), 189\u2013194 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1131_CR35","first-page":"436","volume":"67","author":"S Kunnumkal","year":"2019","unstructured":"Kunnumkal, S., Mart\u00ednez-de Alb\u00e9niz, V.: Tractable approximations for assortment planning with product costs. Oper. Res. 67(2), 436\u2013452 (2019)","journal-title":"Oper. Res."},{"issue":"2","key":"1131_CR36","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y Li","year":"2015","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear\/submodular penalties. Algorithmica 73(2), 460\u2013482 (2015)","journal-title":"Algorithmica"},{"key":"1131_CR37","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11590-020-01596-x","volume":"15","author":"YH Lin","year":"2021","unstructured":"Lin, Y.H., Tian, Q.: Exact approaches for competitive facility location with discrete attractiveness. Optim. Lett. 15, 377\u2013389 (2021)","journal-title":"Optim. Lett."},{"issue":"1","key":"1131_CR38","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2017.09.023","volume":"266","author":"I Ljubi\u0107","year":"2018","unstructured":"Ljubi\u0107, I., Moreno, E.: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266(1), 46\u201356 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1131_CR39","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. (1983). Submodular functions and convexity. In Mathematical programming the state of the art, pages 235\u2013257. Springer","DOI":"10.1007\/978-3-642-68874-4_10"},{"issue":"5","key":"1131_CR40","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/1099-1255(200009\/10)15:5<447::AID-JAE570>3.0.CO;2-1","volume":"15","author":"D McFadden","year":"2000","unstructured":"McFadden, D., Train, K.: Mixed MNL models for discrete response. J. Appl. Economet. 15(5), 447\u2013470 (2000)","journal-title":"J. Appl. Economet."},{"issue":"4","key":"1131_CR41","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo, N., et al.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4), 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1131_CR42","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10898-019-00817-7","volume":"75","author":"E Mehmanchi","year":"2019","unstructured":"Mehmanchi, E., G\u00f3mez, A., Prokopyev, O.A.: Fractional 0\u20131 programs: links between mixed-integer linear and conic quadratic formulations. J. Global Optim. 75(2), 273\u2013339 (2019)","journal-title":"J. Global Optim."},{"key":"1131_CR43","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2012.03.003","volume":"164","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P.: A branch-and-cut algorithm for the latent-class logit assortment problem. Discret. Appl. Math. 164, 246\u2013263 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1131_CR44","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1287\/opre.1120.1093","volume":"61","author":"S Mittal","year":"2013","unstructured":"Mittal, S., Schulz, A.S.: A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Oper. Res. 61(2), 386\u2013397 (2013)","journal-title":"Oper. Res."},{"issue":"3","key":"1131_CR45","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/mnsc.38.3.345","volume":"38","author":"KS Moorthy","year":"1992","unstructured":"Moorthy, K.S., Png, I.P.: Market segmentation, cannibalization, and the timing of product introductions. Manage. Sci. 38(3), 345\u2013359 (1992)","journal-title":"Manage. Sci."},{"issue":"1","key":"1131_CR46","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"4","key":"1131_CR47","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1287\/ijoc.2017.0757","volume":"29","author":"C Ortiz-Astorquiza","year":"2017","unstructured":"Ortiz-Astorquiza, C., Contreras, I., Laporte, G.: Formulations and approximation algorithms for multilevel uncapacitated facility location. INFORMS J. Comput. 29(4), 767\u2013779 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1131_CR48","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.orl.2004.05.011","volume":"33","author":"OA Prokopyev","year":"2005","unstructured":"Prokopyev, O.A., Huang, H.-X., Pardalos, P.M.: On complexity of unconstrained hyperbolic 0\u20131 programming problems. Oper. Res. Lett. 33(3), 312\u2013318 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1131_CR49","first-page":"327","volume":"1","author":"OA Prokopyev","year":"2005","unstructured":"Prokopyev, O.A., Meneses, C., Oliveira, C.A., Pardalos, P.M.: On multiple-ratio hyperbolic 0\u20131 programming problems. Pacific J. Optim. 1(2), 327\u2013345 (2005)","journal-title":"Pacific J. Optim."},{"key":"1131_CR50","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-1-4613-0303-9_6","volume-title":"Handbook of Combinatorial Optimization","author":"T Radzik","year":"1998","unstructured":"Radzik, T.: Fractional combinatorial optimization. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 429\u2013478. Springer-Verlag, New York (1998)"},{"issue":"4","key":"1131_CR51","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.orl.2009.03.009","volume":"37","author":"P Rusmevichientong","year":"2009","unstructured":"Rusmevichientong, P., Shen, Z.-J.M., Shmoys, D.B.: A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37(4), 230\u2013238 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"1131_CR52","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1287\/opre.1100.0866","volume":"58","author":"P Rusmevichientong","year":"2010","unstructured":"Rusmevichientong, P., Shen, Z.-J.M., Shmoys, D.B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6), 1666\u20131680 (2010)","journal-title":"Oper. Res."},{"issue":"11","key":"1131_CR53","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."},{"issue":"1","key":"1131_CR54","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10287-013-0197-z","volume":"12","author":"S Sethuraman","year":"2015","unstructured":"Sethuraman, S., Butenko, S.: The maximum ratio clique problem. CMS 12(1), 197\u2013218 (2015)","journal-title":"CMS"},{"issue":"1","key":"1131_CR55","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1131_CR56","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"K Talluri","year":"2004","unstructured":"Talluri, K., van Ryzin, G.: Revenue management under a general discrete choice model of consumer behavior. Manage. Sci. 50(1), 15\u201333 (2004)","journal-title":"Manage. Sci."},{"key":"1131_CR57","doi-asserted-by":"crossref","unstructured":"Talluri, K.T., van Ryzin, G.J.: The Theory and Practice of Revenue Management, vol.\u00a068. Springer Science & Business Media (2006)","DOI":"10.1287\/educ.1053.0019"},{"issue":"4","key":"1131_CR58","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., Sahinidis, N.V.: Global optimization of 0\u20131 hyperbolic programs. J. Global Optim. 24(4), 385\u2013416 (2002)","journal-title":"J. Global Optim."},{"issue":"3","key":"1131_CR59","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s10898-011-9832-9","volume":"56","author":"O Ursulenko","year":"2013","unstructured":"Ursulenko, O., Butenko, S., Prokopyev, O.A.: A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. J. Global Optim. 56(3), 1029\u20131043 (2013)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01131-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T02:24:00Z","timestamp":1666319040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01131-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,31]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1131"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01131-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,31]]},"assertion":[{"value":"24 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}