{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:10:43Z","timestamp":1772788243308,"version":"3.50.1"},"reference-count":122,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10898-016-0487-4","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T13:05:39Z","timestamp":1482152739000},"page":"255-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Fractional 0\u20131 programming: applications and algorithms"],"prefix":"10.1007","volume":"69","author":[{"given":"Juan S.","family":"Borrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Gillen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"issue":"6","key":"487_CR1","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1120.1106","volume":"60","author":"W Adams","year":"2012","unstructured":"Adams, W., Henry, S.: Base-2 expansions for linearizing products of functions of discrete variables. Oper. Res. 60(6), 1477\u20131490 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"487_CR2","doi-asserted-by":"crossref","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":"4","key":"487_CR3","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2006.08.008","volume":"35","author":"WP Adams","year":"2007","unstructured":"Adams, W.P., Forrester, R.J.: Linear forms of nonlinear expressions: new insights on old ideas. Oper. Res. Lett. 35(4), 510\u2013518 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"487_CR4","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"issue":"2","key":"487_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"WP Adams","year":"2004","unstructured":"Adams, W.P., Forrester, R.J., Glover, F.W.: Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs. Discrete Optim. 1(2), 99\u2013120 (2004)","journal-title":"Discrete Optim."},{"issue":"4","key":"487_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.swevo.2011.06.006","volume":"1","author":"RM Alguliev","year":"2011","unstructured":"Alguliev, R.M., Aliguliyev, R.M., Mehdiyev, C.A.: Sentence selection for generic document summarization using an adaptive differential evolution algorithm. Swarm Evol. Comput. 1(4), 213\u2013222 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"487_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/opre.19.1.57","volume":"19","author":"Y Almogy","year":"1971","unstructured":"Almogy, Y., Levin, O.: A class of fractional programming problems. Oper. Res. 19(1), 57\u201367 (1971)","journal-title":"Oper. Res."},{"issue":"1","key":"487_CR8","doi-asserted-by":"crossref","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."},{"issue":"2","key":"487_CR9","doi-asserted-by":"crossref","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":"3","key":"487_CR10","doi-asserted-by":"crossref","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":"1","key":"487_CR11","first-page":"49","volume":"17","author":"Y Anzai","year":"1974","unstructured":"Anzai, Y.: On integer fractional programming. J. Oper. Res. Soc. Jpn. 17(1), 49\u201366 (1974)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"5","key":"487_CR12","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."},{"key":"487_CR13","doi-asserted-by":"crossref","unstructured":"Avadhanula, V., Bhandari, J., Goyal, V., Zeevi, A.: On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44(5), 612\u2013617 (2016)","DOI":"10.1016\/j.orl.2016.07.001"},{"issue":"2","key":"487_CR14","first-page":"97","volume":"40","author":"A Billionnet","year":"2002","unstructured":"Billionnet, A.: Approximate and exact solution methods for the hyperbolic 0\u20131 knapsack problem. INFOR 40(2), 97 (2002a)","journal-title":"INFOR"},{"issue":"5","key":"487_CR15","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/S0167-6377(02)00157-8","volume":"30","author":"A Billionnet","year":"2002","unstructured":"Billionnet, A.: Approximation algorithms for fractional knapsack problems. Oper. Res. Lett. 30(5), 336\u2013342 (2002b)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"487_CR16","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1287\/opre.24.4.675","volume":"24","author":"GR Bitran","year":"1976","unstructured":"Bitran, G.R., Magnanti, T.L.: Duality and sensitivity analysis for fractional programs. Oper. Res. 24(4), 675\u2013699 (1976)","journal-title":"Oper. Res."},{"issue":"1","key":"487_CR17","doi-asserted-by":"crossref","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":"487_CR18","doi-asserted-by":"crossref","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":"3","key":"487_CR19","doi-asserted-by":"crossref","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":"487_CR20","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10878-005-1856-y","volume":"10","author":"S Busygin","year":"2005","unstructured":"Busygin, S., Prokopyev, O., Pardalos, P.: Feature selection for consistent biclustering via fractional 0\u20131 programming. J. Comb. Optim. 10(1), 7\u201321 (2005)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"487_CR21","doi-asserted-by":"crossref","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"},{"issue":"1","key":"487_CR22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00097-7","volume":"131","author":"CT Chang","year":"2001","unstructured":"Chang, C.T.: On the polynomial mixed 0\u20131 fractional programming problems. Eur. J. Oper. Res. 131(1), 224\u2013227 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"487_CR23","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse, W., Pardalos, P.M., Prokopyev, O.A.: A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper. Res. Lett. 32(6), 517\u2013522 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"487_CR24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.3800100123","volume":"10","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Naval Res. Logist. Q. 10(1), 273\u2013274 (1963)","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"487_CR25","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.27.3.353","volume":"27","author":"MW Cooper","year":"1981","unstructured":"Cooper, M.W.: A survey of methods for pure nonlinear integer programming. Manag. Sci. 27(3), 353\u2013361 (1981)","journal-title":"Manag. Sci."},{"issue":"1\u20132","key":"487_CR26","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10107-010-0364-8","volume":"124","author":"JR Correa","year":"2010","unstructured":"Correa, J.R., Fernandes, C.G., Wakabayashi, Y.: Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1\u20132), 255\u2013269 (2010)","journal-title":"Math. Program."},{"key":"487_CR27","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B., Blattner, W., Rao, M.: Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. Technical report, DTIC Document (1966)","DOI":"10.21236\/AD0646553"},{"issue":"10","key":"487_CR28","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/43.728912","volume":"17","author":"A Dasdan","year":"1998","unstructured":"Dasdan, A., Gupta, R.K.: Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(10), 889\u2013899 (1998)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"487_CR29","unstructured":"Dasdan, A., Irani, S.S., Gupta, R.K. (1999) Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference, ACM, pp. 37\u201342"},{"issue":"2","key":"487_CR30","doi-asserted-by":"crossref","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."},{"issue":"6","key":"487_CR31","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.orl.2013.08.013","volume":"41","author":"VG Deineko","year":"2013","unstructured":"Deineko, V.G., Klinz, B., Woeginger, G.J.: Uniqueness in quadratic and hyperbolic 0\u20131 programming problems. Oper. Res. Lett. 41(6), 633\u2013635 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"487_CR32","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13(7), 492\u2013498 (1967)","journal-title":"Manag. Sci."},{"issue":"6","key":"487_CR33","doi-asserted-by":"crossref","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":"6","key":"487_CR34","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1111\/j.1937-5956.2012.01333.x","volume":"21","author":"A Elomri","year":"2012","unstructured":"Elomri, A., Ghaffari, A., Jemai, Z., Dallery, Y.: Coalition formation and cost allocation for joint replenishment systems. Prod. Oper. Manag. 21(6), 1015\u20131027 (2012)","journal-title":"Prod. Oper. Manag."},{"issue":"2","key":"487_CR35","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(93)90025-J","volume":"46","author":"TR Ervolina","year":"1993","unstructured":"Ervolina, T.R., McCormick, S.T.: Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Discrete Appl. Math. 46(2), 133\u2013165 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"487_CR36","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"J Falk","year":"1994","unstructured":"Falk, J., Palocsay, S.: Image space analysis of generalized fractional programs. J. Global Optim. 4(1), 63\u201388 (1994)","journal-title":"J. Global Optim."},{"issue":"3","key":"487_CR37","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10898-008-9378-7","volume":"45","author":"SC Fang","year":"2009","unstructured":"Fang, S.C., Gao, D.Y., Sheu, R.L., Xing, W.: Global optimization for a class of fractional programming problems. J. Global Optim. 45(3), 337\u2013353 (2009)","journal-title":"J. Global Optim."},{"issue":"3","key":"487_CR38","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/opre.17.3.546","volume":"17","author":"B Fox","year":"1969","unstructured":"Fox, B.: Letter to the editor\u2014finding minimal cost-time ratio circuits. Oper. Res. 17(3), 546\u2013551 (1969)","journal-title":"Oper. Res."},{"key":"487_CR39","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1007\/978-0-387-74759-0_189","volume-title":"Encyclopedia of Optimization","author":"H Frenk","year":"2009","unstructured":"Frenk, H., Schaible, S.: Fractional programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1080\u20131091. Springer, Berlin (2009)"},{"issue":"6","key":"487_CR40","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P Gilmore","year":"1963","unstructured":"Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem-part ii. Oper. Res. 11(6), 863\u2013888 (1963)","journal-title":"Oper. Res."},{"issue":"4","key":"487_CR41","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"1","key":"487_CR42","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Technical note-converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"4","key":"487_CR43","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4), 873\u2013886 (1989)","journal-title":"J. ACM"},{"key":"487_CR44","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ravi, R.: An FPTAS for minimizing a class of quasi-concave functions over a convex set. Oper. Res. Lett. 41(2), 191\u2013196 (2013)","DOI":"10.1016\/j.orl.2013.01.004"},{"key":"487_CR45","first-page":"241","volume":"14","author":"D Granot","year":"1976","unstructured":"Granot, D., Granot, F.: On solving fractional (0, 1) programs by implicit enumeration. Can. J. Oper. Res. Inf. Process. 14, 241\u2013249 (1976)","journal-title":"Can. J. Oper. Res. Inf. Process."},{"issue":"2","key":"487_CR46","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/nav.3800200214","volume":"20","author":"M Grunspan","year":"1973","unstructured":"Grunspan, M., Thomas, M.: Hyperbolic integer programming. Naval Res. Logist. Q. 20(2), 341\u2013356 (1973)","journal-title":"Naval Res. Logist. Q."},{"key":"487_CR47","doi-asserted-by":"crossref","unstructured":"Gupte, A., Ahmed, S., Cheon, M.S., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013)","DOI":"10.1137\/110836183"},{"key":"487_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"PL Hammer","year":"1968","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer Science & Business Media, New York (1968)"},{"issue":"3","key":"487_CR49","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/ijoc.1120.0523","volume":"25","author":"J Han","year":"2013","unstructured":"Han, J., Lee, K., Lee, C., Park, S.: Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS J. Comput. 25(3), 585\u2013596 (2013)","journal-title":"INFORMS J. Comput."},{"key":"487_CR50","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P Hansen","year":"1979","unstructured":"Hansen, P.: Methods of nonlinear 0\u20131 programming. Ann. Discrete Math. 5, 53\u201370 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"1\u20134","key":"487_CR51","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01531072","volume":"1","author":"P Hansen","year":"1990","unstructured":"Hansen, P., de Arag\u00e3o, M., Ribeiro, 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":"487_CR52","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01582890","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., de Arag\u00e3o, M., Ribeiro, C.: Hyperbolic 0\u20131 programming and query optimization in information retrieval. Math. Program. 52(1\u20133), 255\u2013263 (1991)","journal-title":"Math. Program."},{"issue":"2","key":"487_CR53","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","volume":"5","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Mathon, V.: Constrained nonlinear 0\u20131 programming. ORSA J. Comput. 5(2), 97\u2013119 (1993)","journal-title":"ORSA J. Comput."},{"issue":"6","key":"487_CR54","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1002\/net.3230230607","volume":"23","author":"M Hartmann","year":"1993","unstructured":"Hartmann, M., Orlin, J.B.: Finding minimum cost to time ratio cycles with small integral transit times. Networks 23(6), 567\u2013574 (1993)","journal-title":"Networks"},{"issue":"3","key":"487_CR55","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02591737","volume":"37","author":"S Hashizume","year":"1987","unstructured":"Hashizume, S., Fukushima, M., Katoh, N., Ibaraki, T.: Approximation algorithms for combinatorial fractional programming problems. Math. Program. 37(3), 255\u2013267 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"487_CR56","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(76)90091-1","volume":"16","author":"T Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discrete Math. 16(1), 39\u201352 (1976)","journal-title":"Discrete Math."},{"issue":"3","key":"487_CR57","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02591871","volume":"26","author":"T Ibaraki","year":"1983","unstructured":"Ibaraki, T.: Parametric approaches to fractional programs. Math. Program. 26(3), 345\u2013362 (1983)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"487_CR58","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/nav.3800030108","volume":"3","author":"J Isbell","year":"1956","unstructured":"Isbell, J., Marlow, W.: Attrition games. Naval Res. Logist. Q. 3(1\u20132), 71\u201394 (1956)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"487_CR59","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01584342","volume":"13","author":"H Ishii","year":"1977","unstructured":"Ishii, H., Ibaraki, T., Mine, H.: Fractional knapsack problems. Math. Program. 13(1), 255\u2013271 (1977)","journal-title":"Math. Program."},{"issue":"3","key":"487_CR60","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02107055","volume":"11","author":"K Ito","year":"1995","unstructured":"Ito, K., Parhi, K.K.: Determining the minimum iteration period of an algorithm. J. VLSI Signal Process. Syst. Signal Image Video Technol. 11(3), 229\u2013244 (1995)","journal-title":"J. VLSI Signal Process. Syst. Signal Image Video Technol."},{"issue":"3","key":"487_CR61","doi-asserted-by":"crossref","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"},{"issue":"3","key":"487_CR62","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309\u2013311 (1978)","journal-title":"Discrete Math."},{"key":"487_CR63","volume-title":"Queueing Systems, Volume I: Theory","author":"L Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems, Volume I: Theory. Wiley Interscience, New York (1975)"},{"issue":"1","key":"487_CR64","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"487_CR65","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Optimal cycles in graphs and the minimal cost-to-time ratio problem. In: Periodic Optimization, pp. 37\u201360. Springer, Berlin (1972)","DOI":"10.1007\/978-3-7091-2652-3_3"},{"key":"487_CR66","unstructured":"Lawler, E.L.: Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston (1976), reprinted by Dover Publications, Mineola, NY (2001)"},{"issue":"3","key":"487_CR67","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/0377-2217(94)90257-7","volume":"73","author":"HL Li","year":"1994","unstructured":"Li, H.L.: A global approach for general 0\u20131 fractional programming. Eur. J. Oper. Res. 73(3), 590\u2013596 (1994a)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"487_CR68","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1057\/jors.1994.172","volume":"45","author":"HL Li","year":"1994","unstructured":"Li, H.L.: Global optimization for mixed 0\u20131 programs with convex or separable continuous functions. J. Oper. Res. Soc. 45(9), 1068\u20131076 (1994b)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"487_CR69","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"JD Little","year":"1961","unstructured":"Little, J.D.: A proof for the queuing formula: $$L= \\lambda w$$ L = \u03bb w . Oper. Res. 9(3), 383\u2013387 (1961)","journal-title":"Oper. Res."},{"issue":"2","key":"487_CR70","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/nav.3800110204","volume":"11","author":"B Martos","year":"1964","unstructured":"Martos, B., Whinston, V., et al.: Hyperbolic programming. Naval Res. Logist. Q. 11(2), 135\u2013155 (1964)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"487_CR71","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(92)00188-R","volume":"52","author":"ST McCormick","year":"1994","unstructured":"McCormick, S.T., Ervolina, T.R.: Computing maximum mean cuts. Discrete Appl. Math. 52(1), 53\u201370 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"487_CR72","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4), 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"487_CR73","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"487_CR74","doi-asserted-by":"crossref","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., 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":"487_CR75","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-319-18161-5_19","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"M Moeini","year":"2015","unstructured":"Moeini, M.: The maximum ratio clique problem: a continuous optimization approach and some new results. In: HoaiAn, L.T., Tao, P.D., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 215\u2013227. Springer, Berlin (2015)"},{"issue":"1","key":"487_CR76","first-page":"2","volume":"9","author":"A Nagih","year":"2000","unstructured":"Nagih, A., Plateau, G.: A partition algorithm for 0\u20131 unconstrained hyperbolic programs. Investig. Oper. 9(1), 2 (2000)","journal-title":"Investig. Oper."},{"key":"487_CR77","volume-title":"Integer Programming and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer Programming and Combinatorial Optimization. Wiley, Chichester (1988)"},{"key":"487_CR78","first-page":"8","volume":"20","author":"GL Nemhauser","year":"1992","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S.: Constraint classification for mixed integer programming formulations COAL. Bulletin 20, 8\u201312 (1992)","journal-title":"Bulletin"},{"issue":"16","key":"487_CR79","doi-asserted-by":"crossref","first-page":"2462","DOI":"10.1016\/j.dam.2012.06.010","volume":"160","author":"M Nouri","year":"2012","unstructured":"Nouri, M., Ghodsi, M.: Scheduling tasks with exponential duration on unrelated parallel machines. Discrete Appl. Math. 160(16), 2462\u20132473 (2012)","journal-title":"Discrete Appl. Math."},{"key":"487_CR80","doi-asserted-by":"crossref","unstructured":"Nowozin, S.: Optimal decisions from probabilistic models: the intersection-over-union case. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 548\u2013555 (2014)","DOI":"10.1109\/CVPR.2014.77"},{"issue":"1\u20133","key":"487_CR81","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"JB Orlin","year":"1992","unstructured":"Orlin, J.B., Ahuja, R.K.: New scaling algorithms for the assignment and minimum mean cycle problems. Math. Program. 54(1\u20133), 41\u201356 (1992)","journal-title":"Math. Program."},{"issue":"2","key":"487_CR82","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00119990","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Phillips, A.: Global optimization of fractional programs. J. Global Optim. 1(2), 173\u2013182 (1991)","journal-title":"J. Global Optim."},{"issue":"2","key":"487_CR83","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard, J.C., Queyranne, M.: A network flow solution to some nonlinear 0\u20131 programming problems, with applications to graph theory. Networks 12(2), 141\u2013159 (1982)","journal-title":"Networks"},{"key":"487_CR84","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/978-0-387-74759-0_190","volume-title":"Encyclopedia of Optimization","author":"O Prokopyev","year":"2008","unstructured":"Prokopyev, O.: Fractional zero-one programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1091\u20131094. Springer, Berlin (2008)"},{"issue":"3","key":"487_CR85","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.orl.2004.05.011","volume":"33","author":"O Prokopyev","year":"2005","unstructured":"Prokopyev, O., Huang, H.X., Pardalos, P.: 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":"487_CR86","first-page":"327","volume":"1","author":"O Prokopyev","year":"2005","unstructured":"Prokopyev, O., Meneses, C., Oliveira, C., Pardalos, P.: On multiple-ratio hyperbolic 0\u20131 programming problems. Pac. J. Optim. 1(2), 327\u2013345 (2005b)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"487_CR87","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"OA Prokopyev","year":"2009","unstructured":"Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Eur. J. Oper. Res. 197(1), 59\u201367 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"487_CR88","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. J. Global Optim. 6(1), 39\u201376 (1995)","journal-title":"J. Global Optim."},{"key":"487_CR89","doi-asserted-by":"crossref","unstructured":"Radzik, T.: Newton\u2019s method for fractional combinatorial optimization. In: Proceedings 33rd Annual Symposium on Foundations of Computer Science, 1992, IEEE, pp. 659\u2013669 (1992)","DOI":"10.1109\/SFCS.1992.267785"},{"key":"487_CR90","doi-asserted-by":"crossref","unstructured":"Radzik, T.: Parametric flows, weighted means of cuts, and fractional combinatorial optimization. Complex. Numer. Optim., 351\u2013386 (1993)","DOI":"10.1142\/9789814354363_0016"},{"key":"487_CR91","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1007\/978-0-387-74759-0_188","volume-title":"Encyclopedia of Optimization","author":"T Radzik","year":"2009","unstructured":"Radzik, T.: Fractional combinatorial optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1077\u20131079. Springer, Berlin (2009)"},{"key":"487_CR92","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1007\/978-1-4419-7997-1_62","volume-title":"Handbook of Combinatorial Optimization","author":"T Radzik","year":"2013","unstructured":"Radzik, T.: Fractional combinatorial optimization. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1311\u20131355. Springer, Berlin (2013)"},{"issue":"1","key":"487_CR93","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/nav.3800180104","volume":"18","author":"P Robillard","year":"1971","unstructured":"Robillard, P.: (0, 1) hyperbolic programming problems. Naval Res. Logist. Q. 18(1), 47\u201357 (1971)","journal-title":"Naval Res. Logist. Q."},{"key":"487_CR94","unstructured":"Robillard, P., Florian, M.: Hyperbolic Programming with Bivalent Variables. D\u00e9partement d\u2019Informatique, Montreal Universit\u00e9, Publication #41 (1970)"},{"issue":"9","key":"487_CR95","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/S0305-0548(98)00096-3","volume":"26","author":"E Rolland","year":"1999","unstructured":"Rolland, E., Amiri, A., Barkhi, R.: Queueing delay guarantees in bandwidth packing. Comput. Oper. Res. 26(9), 921\u2013935 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"487_CR96","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/nav.3800220308","volume":"22","author":"A Saipe","year":"1975","unstructured":"Saipe, A.: Solving a (0, 1) hyperbolic program by branch and bound. Naval Res. Logist. Q. 22(3), 497\u2013515 (1975)","journal-title":"Naval Res. Logist. Q."},{"key":"487_CR97","doi-asserted-by":"crossref","unstructured":"Schaible, S.: Fractional programming. II, on Dinkelbach\u2019s algorithm. Manag. Sci. 22(8), 868\u2013873 (1976)","DOI":"10.1287\/mnsc.22.8.868"},{"issue":"1","key":"487_CR98","first-page":"39","volume":"27","author":"S Schaible","year":"1983","unstructured":"Schaible, S.: Fractional programming. Zeitschrift f\u00fcr. Oper. Res. 27(1), 39\u201354 (1983)","journal-title":"Oper. Res."},{"key":"487_CR99","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/978-1-4615-2025-2_10","volume-title":"Handbook of Global Optimization","author":"S Schaible","year":"1995","unstructured":"Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 495\u2013608. Springer, Berlin (1995)"},{"issue":"2","key":"487_CR100","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18(2), 219\u2013229 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"487_CR101","doi-asserted-by":"crossref","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. Comput. Manag. Sci. 12(1), 197\u2013218 (2015)","journal-title":"Comput. Manag. Sci."},{"issue":"1","key":"487_CR102","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"H Sherali","year":"2007","unstructured":"Sherali, H., Smith, J.: An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1(1), 33\u201347 (2007)","journal-title":"Optim. Lett."},{"key":"487_CR103","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer Science & Business Media, Berlin (2013)"},{"issue":"1","key":"487_CR104","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Global Optim."},{"issue":"2","key":"487_CR105","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0166-218X(93)00094-G","volume":"56","author":"M Shigeno","year":"1995","unstructured":"Shigeno, M., Saruwatari, Y., Matsui, T.: An algorithm for fractional assignment problems. Discrete Appl. Math. 56(2), 333\u2013343 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"487_CR106","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1008340311108","volume":"19","author":"CC Skiscim","year":"2001","unstructured":"Skiscim, C.C., Palocsay, S.W.: Minimum spanning trees with sums of ratios. J. Global Optim. 19(2), 103\u2013120 (2001)","journal-title":"J. Global Optim."},{"issue":"4","key":"487_CR107","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10898-004-5119-8","volume":"30","author":"CC Ski\u015bcim","year":"2004","unstructured":"Ski\u015bcim, C.C., Palocsay, S.W.: The complexity of minimum ratio spanning tree problems. J. Global Optim. 30(4), 335\u2013346 (2004)","journal-title":"J. Global Optim."},{"key":"487_CR108","volume-title":"Fractional Programming: Theory, Methods and Applications","author":"I Stancu-Minasian","year":"2012","unstructured":"Stancu-Minasian, I.: Fractional Programming: Theory, Methods and Applications, vol. 409. Springer Science & Business Media, Berlin (2012)"},{"issue":"2","key":"487_CR109","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10898-009-9491-2","volume":"48","author":"S Subramanian","year":"2010","unstructured":"Subramanian, S., Sherali, H.: 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":"487_CR110","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., Sahinidis, N.: Global optimization of 0\u20131 hyperbolic programs. J. Global Optim. 24(4), 385\u2013416 (2002)","journal-title":"J. Global Optim."},{"issue":"1","key":"487_CR111","doi-asserted-by":"crossref","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":"487_CR112","doi-asserted-by":"crossref","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."},{"key":"487_CR113","unstructured":"Ursulenko, O.: Exact methods in fractional combinatorial optimization. Ph.D. thesis, Texas A&M University (2009)"},{"issue":"3","key":"487_CR114","doi-asserted-by":"crossref","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."},{"issue":"1\u20132","key":"487_CR115","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"J Vielma","year":"2011","unstructured":"Vielma, J., Nemhauser, G.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1\u20132), 49\u201372 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"487_CR116","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s10898-005-1649-y","volume":"34","author":"Q Wang","year":"2006","unstructured":"Wang, Q., Yang, X., Zhang, J.: A class of inverse dominant problems under weighted l8 norm and an improved complexity bound for Radzik\u2019s algorithm. J. Global Optim. 34(4), 551\u2013567 (2006)","journal-title":"J. Global Optim."},{"issue":"3","key":"487_CR117","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.orl.2016.03.016","volume":"44","author":"R Wang","year":"2016","unstructured":"Wang, R.: On the sum-product ratio problem and its applications. Oper. Res. Lett. 44(3), 409\u2013414 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"487_CR118","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L Watters","year":"1967","unstructured":"Watters, L.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. 15(6), 1171\u20131174 (1967)","journal-title":"Oper. Res."},{"key":"487_CR119","volume-title":"Experiments in the Formulation of Integer Programming Problems","author":"H Williams","year":"1974","unstructured":"Williams, H.: Experiments in the Formulation of Integer Programming Problems. Springer, Berlin (1974)"},{"issue":"1","key":"487_CR120","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","volume":"101","author":"TH 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."},{"issue":"2","key":"487_CR121","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"NE Young","year":"1991","unstructured":"Young, N.E., Tarjant, R.E., Orlin, J.B.: Faster parametric shortest path and minimum-balance algorithms. Networks 21(2), 205\u2013221 (1991)","journal-title":"Networks"},{"issue":"11","key":"487_CR122","doi-asserted-by":"crossref","first-page":"4255","DOI":"10.1002\/aic.14185","volume":"59","author":"D Yue","year":"2013","unstructured":"Yue, D., Guill\u00e9n-Gos\u00e1lbez, G., You, F.: Global optimization of large-scale mixed-integer linear fractional programming problems: A reformulation-linearization method and process scheduling applications. AIChE J. 59(11), 4255\u20134272 (2013)","journal-title":"AIChE J."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0487-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0487-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0487-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T10:29:46Z","timestamp":1692613786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0487-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":122,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0487-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,19]]}}}