{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:18:15Z","timestamp":1743070695385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030499877"},{"type":"electronic","value":"9783030499884"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49988-4_8","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"115-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Solving the Quadratic Sum-of-Ratios Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4579-3927","authenticated-orcid":false,"given":"Tatiana V.","family":"Gruzdeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4664-6961","authenticated-orcid":false,"given":"Alexander S.","family":"Strekalovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"8_CR1","first-page":"596","volume":"268","author":"AM Ashtiani","year":"2015","unstructured":"Ashtiani, A.M., Ferreira, P.A.V.: A branch-and-cut algorithm for a class of sum-of-ratios problems. Appl. Math. Comput. 268, 596\u2013608 (2015)","journal-title":"Appl. Math. Comput."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-22629-9_2","volume-title":"Mathematical Optimization Theory and Operations Research","author":"MV Barkova","year":"2019","unstructured":"Barkova, M.V.: On generating nonconvex optimization test problems. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 21\u201333. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_2"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s12532-015-0089-z","volume":"8","author":"F Bugarin","year":"2015","unstructured":"Bugarin, F., Henrion, D., Lasserre, J.B.: Minimizing the sum of many rational functions. Math. Programm. Comput. 8(1), 83\u2013111 (2015). \nhttps:\/\/doi.org\/10.1007\/s12532-015-0089-z","journal-title":"Math. Programm. Comput."},{"key":"8_CR4","doi-asserted-by":"publisher","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, 492\u2013498 (1967)","journal-title":"Manag. Sci."},{"issue":"5\u20136","key":"8_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1080\/02331930108844543","volume":"49","author":"M Dur","year":"2001","unstructured":"Dur, M., Horst, R., Thoai, N.V.: Solving sum-of-ratios fractional programs using efficient points. Optimization 49(5\u20136), 447\u2013466 (2001)","journal-title":"Optimization"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19(1), 83\u2013102 (2001). \nhttps:\/\/doi.org\/10.1023\/A:1008316327038","journal-title":"J. Glob. Optim."},{"key":"8_CR7","series-title":"Series Nonconvex Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/b101428","volume-title":"Handbook of Generalized Convexity and Generalized Monotonicity","author":"JBG Frenk","year":"2002","unstructured":"Frenk, J.B.G., Schaible, S.: Fractional programming. In: Hadjisavvas, S.S.N., Komlosi, S. (eds.) Handbook of Generalized Convexity and Generalized Monotonicity. Series Nonconvex Optimization and Its Applications, vol. 76, pp. 335\u2013386. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/b101428"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2298\/YJOR171115003G","volume":"29","author":"TV Gruzdeva","year":"2019","unstructured":"Gruzdeva, T.V., Enkhbat, R., Tungalag, N.: Fractional programming approach to a cost minimization problem in electricity market. Yugoslav J. Oper. Res. 29(1), 43\u201350 (2019)","journal-title":"Yugoslav J. Oper. Res."},{"key":"8_CR9","first-page":"260","volume":"318","author":"TV Gruzdeva","year":"2018","unstructured":"Gruzdeva, T.V., Strekalovskiy, A.S.: On solving the sum-of-ratios problem. Appl. Math. Comput. 318, 260\u2013269 (2018)","journal-title":"Appl. Math. Comput."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-319-44914-2_32","volume-title":"Discrete Optimization and Operations Research","author":"T Gruzdeva","year":"2016","unstructured":"Gruzdeva, T., Strekalovsky, A.: An approach to fractional programming via D.C. constraints problem: local search. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 404\u2013417. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_32"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-69404-7_27","volume-title":"Learning and Intelligent Optimization","author":"T Gruzdeva","year":"2017","unstructured":"Gruzdeva, T., Strekalovsky, A.: A D.C. programming approach to fractional problems. In: Battiti, R., Kvasov, D.E., Sergeyev, Y.D. (eds.) LION 2017. LNCS, vol. 10556, pp. 331\u2013337. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69404-7_27"},{"key":"8_CR12","unstructured":"Gruzdeva, T.V., Strekalovsky, A.S.: On a Solution of Fractional Programs via D.C. Optimization Theory. In: CEUR Workshop Proceedings, OPTIMA-2017, vol. 1987, pp. 246\u2013252 (2017)"},{"key":"8_CR13","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-45610-7_3","volume-title":"Convexity and Duality in Optimization","author":"JB Hiriart-Urruty","year":"1985","unstructured":"Hiriart-Urruty, J.B.: Generalized differentiability, duality and optimization for problems dealing with difference of convex finctions. In: Ponstein, J. (ed.) Convexity and Duality in Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 256, pp. 37\u201369. Springer, Berlin (1985). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45610-7_3"},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03199-5"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1995)","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T Kuno","year":"2002","unstructured":"Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155\u2013174 (2002). \nhttps:\/\/doi.org\/10.1023\/A:1013807129844","journal-title":"J. Glob. Optim."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.4304\/jsw.8.1.118-125","volume":"8","author":"B Ma","year":"2013","unstructured":"Ma, B., Geng, L., Yin, J., Fan, L.: An effective algorithm for globally solving a class of linear fractional programming problem. J. Softw. 8(1), 118\u2013125 (2013)","journal-title":"J. Softw."},{"key":"8_CR18","doi-asserted-by":"publisher","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. Meth. Softw. 18, 219\u2013229 (2003)","journal-title":"Optim. Meth. Softw."},{"key":"8_CR19","volume-title":"Elements of Nonconvex Optimization","author":"AS Strekalovsky","year":"2003","unstructured":"Strekalovsky, A.S.: Elements of Nonconvex Optimization. Nauka, Novosibirsk (2003). (in Russian)"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11590-017-1214-x","volume":"13","author":"AS Strekalovsky","year":"2019","unstructured":"Strekalovsky, A.S.: Global optimality conditions and exact penalization. Optim. Lett. 13(3), 597\u2013615 (2019). \nhttps:\/\/doi.org\/10.1007\/s11590-017-1214-x","journal-title":"Optim. Lett."},{"key":"8_CR21","first-page":"73","volume":"255","author":"AS Strekalovsky","year":"2015","unstructured":"Strekalovsky, A.S.: On local search in d.c. optimization problems. Appl. Math. Comput. 255, 73\u201383 (2015)","journal-title":"Appl. Math. Comput."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-1-4939-0808-0_23","volume-title":"Optimization in Science and Engineering","author":"AS Strekalovsky","year":"2014","unstructured":"Strekalovsky, A.S.: On solving optimization problems with hidden nonconvex structures. In: Rassias, T.M., Floudas, C.A., Butenko, S. (eds.) Optimization in Science and Engineering, pp. 465\u2013502. Springer, New York (2014). \nhttps:\/\/doi.org\/10.1007\/978-1-4939-0808-0_23"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-319-44914-2_36","volume-title":"Discrete Optimization and Operations Research","author":"AS Strekalovsky","year":"2016","unstructured":"Strekalovsky, A.S.: On the merit and penalty functions for the D.C. Optimization. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 452\u2013466. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_36"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1007\/s10957-016-0998-7","volume":"173","author":"AS Strekalovsky","year":"2017","unstructured":"Strekalovsky, A.S.: Global optimality conditions in nonconvex optimization. J. Optim. Theory Appl. 173(3), 770\u2013792 (2017). \nhttps:\/\/doi.org\/10.1007\/s10957-016-0998-7","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"8_CR25","first-page":"418","volume":"45","author":"AS Strekalovsky","year":"2005","unstructured":"Strekalovsky, A.S.: Minimizing sequences in problems with D.C. constraints. Comput. Math. Math. Phys. 45(3), 418\u2013429 (2005)","journal-title":"Comput. Math. Math. Phys."},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1134\/S0965542507110061","volume":"47","author":"AS Strekalovsky","year":"2007","unstructured":"Strekalovsky, A.S., Gruzdeva, T.V.: Local Search in Problems with Nonconvex Constraints. Comput. Math. Math. Phys. 47, 381\u2013396 (2007)","journal-title":"Comput. Math. Math. Phys."},{"key":"8_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4677-1","volume-title":"Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms","author":"RG Strongin","year":"2000","unstructured":"Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms. Springer, New York (2000)"},{"key":"8_CR28","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-31484-6_9","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Parametric decomposition. Convex Analysis and Global Optimization. SOIA, vol. 110, pp. 283\u2013336. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31484-6_9"},{"issue":"3","key":"8_CR29","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF00249639","volume":"1","author":"LN Vicente","year":"1992","unstructured":"Vicente, L.N., Calamai, P.H., Judice, J.J.: Generation of disjointly constrained bilinear programming test problems. Comput. Optim. Appl. 1(3), 299\u2013306 (1992). \nhttps:\/\/doi.org\/10.1007\/BF00249639","journal-title":"Comput. Optim. Appl."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:03:21Z","timestamp":1593385401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}