{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:51Z","timestamp":1740098991015,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319694030"},{"type":"electronic","value":"9783319694047"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69404-7_27","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:43:57Z","timestamp":1508834637000},"page":"331-337","source":"Crossref","is-referenced-by-count":1,"title":["A D.C. Programming Approach to Fractional Problems"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Gruzdeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Strekalovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s12532-015-0089-z","volume":"8","author":"F Bugarin","year":"2016","unstructured":"Bugarin, F., Henrion, D., Lasserre, J.-B.: Minimizing the sum of many rational functions. Math. Prog. Comput. 8, 83\u2013111 (2016)","journal-title":"Math. Prog. Comput."},{"issue":"3","key":"27_CR2","first-page":"742","volume":"33","author":"W Chun-feng","year":"2013","unstructured":"Chun-feng, W., San-yang, L.: New method for solving nonlinear sum of ratios problem based on simplicial bisection. Syst. Eng. Theory Pract. 33(3), 742\u2013747 (2013)","journal-title":"Syst. Eng. Theory Pract."},{"key":"27_CR3","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. Manage. Sci. 13, 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"issue":"1","key":"27_CR4","doi-asserted-by":"crossref","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. Global Optim. 19(1), 83\u2013102 (2001)","journal-title":"J. Global Optim."},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"090010","DOI":"10.1063\/1.4965374","volume":"1776","author":"TV Gruzdeva","year":"2016","unstructured":"Gruzdeva, T.V., Strekalovsky, A.S.: An approach to fractional programming via d.c. optimization. AIP Conf. Proc. 1776, 090010 (2016)","journal-title":"AIP Conf. Proc."},{"key":"27_CR6","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":"TV Gruzdeva","year":"2016","unstructured":"Gruzdeva, T.V., Strekalovsky, A.S.: 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). doi:\n10.1007\/978-3-319-44914-2_32"},{"issue":"1","key":"27_CR7","first-page":"118","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":"27_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ejor.2006.02.021","volume":"178","author":"P Pandey","year":"2007","unstructured":"Pandey, P., Punnen, A.P.: A simplex algorithm for piecewise-linear fractional programming problems. European J. of Oper. Res. 178, 343\u2013358 (2007)","journal-title":"European J. of Oper. Res."},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s40092-014-0056-8","volume":"10","author":"OA Raouf","year":"2014","unstructured":"Raouf, O.A., Hezam, I.M.: Solving fractional programming problems based on swarm intelligence. J. Ind. Eng. Int. 10, 56\u201366 (2014)","journal-title":"J. Ind. Eng. Int."},{"key":"27_CR10","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, 219\u2013229 (2003)","journal-title":"Optim. Methods Softw."},{"key":"27_CR11","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). doi:\n10.1007\/978-1-4939-0808-0_23"},{"key":"27_CR12","volume-title":"Elements of nonconvex optimization","author":"AS Strekalovsky","year":"2003","unstructured":"Strekalovsky, A.S.: Elements of nonconvex optimization. Nauka, Novosibirsk (2003). [in Russian]"},{"key":"27_CR13","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\u00a0the\u00a0d.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). doi:\n10.1007\/978-3-319-44914-2_36"},{"key":"27_CR14","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."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69404-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:50:51Z","timestamp":1508835051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69404-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694030","9783319694047"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69404-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}