{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:20:12Z","timestamp":1760473212007,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T00:00:00Z","timestamp":1686441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T00:00:00Z","timestamp":1686441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s12351-023-00777-7","type":"journal-article","created":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T15:01:26Z","timestamp":1686495686000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A heuristic method to find a quick feasible solution based on the ratio programming"],"prefix":"10.1007","volume":"23","author":[{"given":"M. N.","family":"Yarahmadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-7053","authenticated-orcid":false,"given":"S. A.","family":"MirHassani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hooshmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,11]]},"reference":[{"key":"777_CR1","doi-asserted-by":"crossref","unstructured":"A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P.M. Christophel, K. Jarck, T. Koch, J. Linderoth, M. L\u00a8ubbecke, H.D. Mittelmann, D. Ozyurt, T.K. Ralphs, D. Salvagnin and Y. Shinano, \u201cMIPLIB 2017: Data-driven compilation of the 6th mixed-integer programming library,\u201d (2021) (http:\/\/miplib2017.zib.de\/tag_benchmark.html)","DOI":"10.1007\/s12532-020-00194-3"},{"key":"777_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg T, Berthold T (2007) Improving the feasibility pump. Discret Optim 4:77\u201386","journal-title":"Discret Optim"},{"key":"777_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1111\/itor.12578","volume":"27","author":"T Adamo","year":"2020","unstructured":"Adamo T, Ghiani G, Guerriero E, Manni E (2020) A learn-and-construct framework for general mixed-integer programming problems. Int Trans Oper Res 27:9\u201325","journal-title":"Int Trans Oper Res"},{"key":"777_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2017.05.003","volume":"263","author":"CE Andrade","year":"2017","unstructured":"Andrade CE, Ahmed S, Nemhauser GL, Shao Y (2017) A hybrid primal heuristic for finding feasible solutions to mixed integer programs. Eur J Oper Res 263:62\u201371","journal-title":"Eur J Oper Res"},{"key":"777_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.orl.2011.07.005","volume":"39","author":"D Baena","year":"2011","unstructured":"Baena D, Castro J (2011) Using the analytic centre in the feasibility pump. Oper Res Lett 39:310\u2013317","journal-title":"Oper Res Lett"},{"key":"777_CR6","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1007\/s11253-018-1464-5","volume":"69","author":"D Behati","year":"2017","unstructured":"Behati D, Singh P (2017) Multi-objective nonlinear sum of fractional optimization problems with non-convex constraints with the use of the duality-based branch and bound algorithm. Ukr Math J 69:1689\u20131709","journal-title":"Ukr Math J"},{"key":"777_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"HP Benson","year":"2010","unstructured":"Benson HP (2010) Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs. J Optim Theory Appl 146:1\u201318","journal-title":"J Optim Theory Appl"},{"key":"777_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco L, Fischetti M, Lodi A (2007) A feasibility pump heuristic for general mixed-integer problems. Discret Optim 4:63\u201376","journal-title":"Discret Optim"},{"key":"777_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","volume":"6","author":"T Berthold","year":"2014","unstructured":"Berthold T (2014) RENS-The optimal rounding. Math Program Comput 6:33\u201354","journal-title":"Math Program Comput"},{"key":"777_CR10","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/110823596","volume":"22","author":"NL Boland","year":"2012","unstructured":"Boland NL, Eberhard AC, Engineer FG, Tsoukalas A (2012) A new approach to the feasibility pump in mixed-integer programming. SIAM J Optim 22:831\u2013861","journal-title":"SIAM J Optim"},{"key":"777_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami P, Biegler LT, Conn AR, Cornuejols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Naoum-Sawaya J, Waechter N (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discret Optim 5:186\u2013204","journal-title":"Discret Optim"},{"key":"777_CR12","volume-title":"Mathematical optimization in computer graphics and vision","author":"PCP Carvalho","year":"2008","unstructured":"Carvalho PCP, Figueiredo LH, Gomes J, Velho L (2008) Mathematical optimization in computer graphics and vision. Elsevier, Morgan Kaufmann Publishers"},{"key":"777_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.ijepes.2015.11.118","volume":"78","author":"F Chen","year":"2016","unstructured":"Chen F, Huang GH, Fan Y, Liao RF (2016) A nonlinear fractional programming approach for environmental\u2013economic power dispatch. Int J Electr Power Energy Syst 78:463\u2013469","journal-title":"Int J Electr Power Energy Syst"},{"key":"777_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71\u201390","journal-title":"Math Program"},{"key":"777_CR15","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1137\/110855351","volume":"23","author":"M de Santis","year":"2013","unstructured":"de Santis M, Lucidi S, Rinaldi F (2013) A new class of functions for measuring solution integrality in the feasibility pump approach. SIAM J Optim 23:1575\u20131606","journal-title":"SIAM J Optim"},{"key":"777_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math Program 104:91\u2013104","journal-title":"Math Program"},{"key":"777_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98:23\u201347","journal-title":"Math Program"},{"key":"777_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-009-0007-3","volume":"1","author":"M Fischetti","year":"2009","unstructured":"Fischetti M, Salvagnin D (2009) Feasibility pump 2.0. Math Program Comput 1:201\u2013222","journal-title":"Math Program Comput"},{"key":"777_CR19","doi-asserted-by":"crossref","unstructured":"Gao Y and Jin S (2013) A global optimization algorithm for sum of linear ratios problem. J Appl Math 785\u2013790","DOI":"10.1155\/2013\/276245"},{"key":"777_CR20","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover F, Laguna M (2000) Fundamentals of scatter search and path relinking. Control Cybern 29:653\u2013684","journal-title":"Control Cybern"},{"key":"777_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2298\/YJOR171115003G","volume":"29","author":"T Gruzdeva","year":"2019","unstructured":"Gruzdeva T, Enkhbat R, Tungalag N (2019) Fractional programming approach to a cost minimization problem in the electricity market. Yugoslav J Op Res 29:43\u201350","journal-title":"Yugoslav J Op Res"},{"key":"777_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2016.12.010","volume":"318","author":"TV Gruzdeva","year":"2017","unstructured":"Gruzdeva TV, Strekalovsky AS (2017) On solving the sum-of-ratios problem. Appl Math Comput 318:1\u201310","journal-title":"Appl Math Comput"},{"key":"777_CR23","first-page":"185","volume":"40","author":"T Hasuike","year":"2010","unstructured":"Hasuike T, Katagiri H (2010) Sensitivity analysis for random fuzzy portfolio selection model with investor\u2032s subjectivity. IAENG Int J Appl Math 40:185\u2013189","journal-title":"IAENG Int J Appl Math"},{"key":"777_CR24","unstructured":"J. Linderoth and T. Ralphs:, \u201cMixed integer programming instances,\u201d (2007) (https:\/\/coral.ise.lehigh.edu\/data-sets\/mixed-integer-instances\/)"},{"key":"777_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s13226-021-00102-y","author":"YJ Kim","year":"2021","unstructured":"Kim YJ, Jong YC, Yu JW (2021) A parametric solution method for a generalized fractional programming problem. Indian J Pure Appl Math. https:\/\/doi.org\/10.1007\/s13226-021-00102-y","journal-title":"Indian J Pure Appl Math"},{"key":"777_CR26","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.orl.2017.10.003","volume":"45","author":"U Koc","year":"2017","unstructured":"Koc U, Mehrotra S (2017) Generation of feasible integer solutions on a massively parallel computer using the feasibility pump. Op Res Lett 45:652\u2013658","journal-title":"Op Res Lett"},{"key":"777_CR27","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ipl.2016.10.009","volume":"118","author":"M Li","year":"2017","unstructured":"Li M, Liu Q (2017) Inexact feasibility pump for mixed-integer nonlinear programming. Inf Process Lett 118:110\u2013116","journal-title":"Inf Process Lett"},{"key":"777_CR28","first-page":"1","volume":"7","author":"X Liu","year":"2019","unstructured":"Liu X, Gao YL, Zhang B, Tian FP (2019) A new global optimization algorithm for a class of linear fractional programming. Math J 7:1\u201321","journal-title":"Math J"},{"key":"777_CR29","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2013.09.008","volume":"43","author":"J Naoum-Sawaya","year":"2014","unstructured":"Naoum-Sawaya J (2014) Recursive central rounding for mixed integer programs. Comput Op Res 43:191\u2013200","journal-title":"Comput Op Res"},{"key":"777_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7763\/IJMO.2017.V7.564","volume":"7","author":"SME Pourmohammad Azizi","year":"2017","unstructured":"Pourmohammad Azizi SME, Neisy A (2017) Mathematic modelling and optimization of bank asset and liability by using fractional goal programming approach. Int J Model Optim 7:85\u201391","journal-title":"Int J Model Optim"},{"key":"777_CR31","first-page":"1","volume":"56","author":"OA Raouf","year":"2014","unstructured":"Raouf OA, Hezam IM (2014) Solving fractional programming problems based on swarm intelligence. J Ind Eng Int 56:1\u201310","journal-title":"J Ind Eng Int"},{"key":"777_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.2018.0822","volume":"31","author":"R Sadykov","year":"2019","unstructured":"Sadykov R, Vanderbeck F, Pessoa A, Tahiri I, Tahiri I (2019) Primal heuristics for branch and price: the assets of diving methods. INFORMS J Comput 31:1\u201317","journal-title":"INFORMS J Comput"},{"key":"777_CR33","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1561\/0100000088","volume":"11","author":"A Zappone","year":"2015","unstructured":"Zappone A, Jorswieck E (2015) Energy efficiency in wireless networks via fractional programming theory. Foundations Trends Commun Inf Theory 11:185\u2013396","journal-title":"Foundations Trends Commun Inf Theory"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00777-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-023-00777-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-023-00777-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T10:21:06Z","timestamp":1694168466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-023-00777-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,11]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["777"],"URL":"https:\/\/doi.org\/10.1007\/s12351-023-00777-7","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2023,6,11]]},"assertion":[{"value":"14 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}