{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:21:05Z","timestamp":1772716865967,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:00:00Z","timestamp":1567728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:00:00Z","timestamp":1567728000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1818700"],"award-info":[{"award-number":["1818700"]}],"id":[{"id":"10.13039\/100000086","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":[[2019,10]]},"DOI":"10.1007\/s10898-019-00817-7","type":"journal-article","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T14:50:58Z","timestamp":1567781458000},"page":"273-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Fractional 0\u20131 programs: links between mixed-integer linear and conic quadratic formulations"],"prefix":"10.1007","volume":"75","author":[{"given":"Erfan","family":"Mehmanchi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2888-8630","authenticated-orcid":false,"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"issue":"1","key":"817_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"WP Adams","year":"2005","unstructured":"Adams, W.P., Forrester, R.J.: A simple recipe for concise mixed 0\u20131 linearizations. Oper. Res. Lett. 33(1), 55\u201361 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"817_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-010-0431-1","volume":"134","author":"E Amaldi","year":"2012","unstructured":"Amaldi, E., Bosio, S., Malucelli, F.: Hyperbolic set covering problems with competing ground-set elements. Math. Program. 134(2), 323\u2013348 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"817_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/opre.1100.0897","volume":"59","author":"E Amaldi","year":"2011","unstructured":"Amaldi, E., Bosio, S., Malucelli, F., Yuan, D.: Solving nonlinear covering problems arising in wlan design. Oper. Res. 59(1), 173\u2013187 (2011)","journal-title":"Oper. Res."},{"key":"817_CR4","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Submodularity in conic quadratic mixed 0\u20131 optimization. (2018). arXiv preprint arXiv:1705.05918"},{"issue":"5","key":"817_CR5","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. Opera. Res. Lett. 36(5), 618\u2013622 (2008)","journal-title":"Opera. Res. Lett."},{"issue":"2","key":"817_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"key":"817_CR7","unstructured":"Bertsimas, D., Korolko, N., Weinstein, A.M.: Identifying exceptional responders in randomized trials: an optimization approach. Informs J. Optim"},{"issue":"1","key":"817_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.: Pseudo-boolean optimization. Discrete Appl. Math. 123(1), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"817_CR9","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":"817_CR10","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":"3","key":"817_CR11","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":"1","key":"817_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10878-005-1856-y","volume":"10","author":"S Busygin","year":"2005","unstructured":"Busygin, S., Prokopyev, O.A., Pardalos, P.M.: Feature selection for consistent biclustering via fractional 0\u20131 programming. J. Comb. Optim. 10(1), 7\u201321 (2005)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"817_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.2014.1256","volume":"62","author":"JM Davis","year":"2014","unstructured":"Davis, J.M., Gallego, G., Topaloglu, H.: Assortment optimization under variants of the nested logit model. Oper. Res. 62(2), 250\u2013273 (2014)","journal-title":"Oper. Res."},{"key":"817_CR14","first-page":"69","volume":"58","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. Comb. Struct. Their Appl. 58, 69\u201387 (1970)","journal-title":"Comb. Struct. Their Appl."},{"issue":"6","key":"817_CR15","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":"817_CR16","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":"817_CR17","unstructured":"G\u00f3mez, A., Prokopyev, O.A.: A mixed-integer fractional optimization approach to best subset selection. Optimization-Online (2018)"},{"key":"817_CR18","unstructured":"Gurobi: Gurobi optimizer reference manual v. 8. (2018) http:\/\/www.gurobi.com"},{"issue":"1\u20133","key":"817_CR19","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."},{"issue":"1","key":"817_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01531072","volume":"1","author":"P Hansen","year":"1990","unstructured":"Hansen, P., Poggi de Arag\u00e3o, M.V., Ribeiro, C.C.: Boolean query optimization and the 0\u20131 hyperbolic sum problem. Ann. Math. Artif. Intell. 1(1), 97\u2013109 (1990)","journal-title":"Ann. Math. Artif. Intell."},{"key":"817_CR21","unstructured":"IBM: ILOG CPLEX Optimizer v. 12.7.1. (2017) http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/"},{"issue":"3","key":"817_CR22","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/0377-2217(94)90257-7","volume":"73","author":"H-L Li","year":"1994","unstructured":"Li, H.-L.: A global approach for general 0\u20131 fractional programming. Eur. J. Oper. Res. 73(3), 590\u2013596 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"817_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming The State of the Art","author":"L. Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical Programming The State of the Art, pp. 235\u2013257. Springer, Berlin (1983)"},{"key":"817_CR24","doi-asserted-by":"crossref","unstructured":"Mehmanchi, E., Gillen, C.P., G\u00f3mez, A., Prokopyev, O.A.: On robust fractional 0\u20131 programming. INFORMS J. Optim. (2019) (accepted)","DOI":"10.1287\/ijoo.2019.0025"},{"key":"817_CR25","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. Discrete Appl. Math. 164, 246\u2013263 (2014)","journal-title":"Discrete Appl. Math."},{"key":"817_CR26","unstructured":"Nguyen, H.\u00a0T., Franke, K., Petrovic, S.: Towards a generic feature-selection measure for intrusion detection. In: 20th International Conference on Pattern Recognition (ICPR), 2010, pp. 1529\u20131532. IEEE (2010)"},{"key":"817_CR27","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/978-0-387-74759-0_190","volume-title":"Encyclopedia of Optimization","author":"OA Prokopyev","year":"2008","unstructured":"Prokopyev, O.A.: Fractional zero-one programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1091\u20131094. Springer, Berlin (2008)"},{"issue":"3","key":"817_CR28","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 (2005a)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"817_CR29","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. Pac. J. Optim. 1(2), 327\u2013345 (2005b)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"817_CR30","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":"3","key":"817_CR31","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/nav.3800220308","volume":"22","author":"AL Saipe","year":"1975","unstructured":"Saipe, A.L.: Solving a (0, 1) hyperbolic program by branch and bound. Naval Res. Logist. 22(3), 497\u2013515 (1975)","journal-title":"Naval Res. Logist."},{"issue":"4","key":"817_CR32","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S Schaible","year":"1983","unstructured":"Schaible, S., Ibaraki, T.: Fractional programming. Eur. J. Oper. Res. 12(4), 325\u2013338 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"817_CR33","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1287\/opre.2017.1703","volume":"66","author":"A \u015een","year":"2018","unstructured":"\u015een, A., Atamt\u00fcrk, A., Kaminsky, P.: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4), 994\u20131003 (2018)","journal-title":"Oper. Res."},{"issue":"4","key":"817_CR34","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1080\/02331930600819613","volume":"55","author":"I Stancu-Minasian","year":"2006","unstructured":"Stancu-Minasian, I.: A sixth bibliography of fractional programming. Optimization 55(4), 405\u2013428 (2006)","journal-title":"Optimization"},{"issue":"2","key":"817_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10898-009-9491-2","volume":"48","author":"S Subramanian","year":"2010","unstructured":"Subramanian, S., Sherali, H.D.: A fractional programming approach for retail category price optimization. J. Global Optim. 48(2), 263\u2013277 (2010)","journal-title":"J. Global Optim."},{"issue":"4","key":"817_CR36","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":"1","key":"817_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-008-9186-5","volume":"20","author":"A Trapp","year":"2010","unstructured":"Trapp, A., Prokopyev, O.A., Busygin, S.: Finding checkerboard patterns via fractional 0\u20131 programming. J. Comb. Optim. 20(1), 1\u201326 (2010)","journal-title":"J. Comb. Optim."},{"issue":"11","key":"817_CR38","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1080\/0740817X.2015.1019161","volume":"47","author":"AC Trapp","year":"2015","unstructured":"Trapp, A.C., Konrad, R.A.: Finding diverse optima and near-optima to binary integer programs. IIE Trans. 47(11), 1300\u20131312 (2015)","journal-title":"IIE Trans."},{"issue":"3","key":"817_CR39","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"817_CR40","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12532-016-0113-y","volume":"9","author":"JP Vielma","year":"2017","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming. Math. Program. Comput. 9(3), 369\u2013418 (2017)","journal-title":"Math. Program. Comput."},{"key":"817_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120693","volume-title":"Experiments in the Formulation of Integer Programming Problems","author":"HP Williams","year":"1974","unstructured":"Williams, H.P.: Experiments in the Formulation of Integer Programming Problems. Springer, Berlin (1974)"},{"issue":"1","key":"817_CR42","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","volume":"101","author":"T-H Wu","year":"1997","unstructured":"Wu, T.-H.: A note on a global approach for general 0\u20131 fractional programming. Eur. J. Oper. Res. 101(1), 220\u2013223 (1997)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00817-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00817-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00817-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T19:25:34Z","timestamp":1664306734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00817-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,6]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["817"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00817-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,6]]},"assertion":[{"value":"22 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}