{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:16Z","timestamp":1742913856055,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_7","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"101-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["D.C. Constrained Optimization Approach for Solving Metal Recovery Processing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0999-1069","authenticated-orcid":false,"given":"Rentsen","family":"Enkhbat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4579-3927","authenticated-orcid":false,"given":"Tatiana V.","family":"Gruzdeva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamsranjav","family":"Enkhbayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1008306625093","volume":"16","author":"O Barrients","year":"2000","unstructured":"Barrients, O., Correa, R.: An algorithm for global minimizatoion of linearly constrained quadratic functions. J. Global Optim. 16, 77\u201393 (2000). https:\/\/doi.org\/10.1023\/A:1008306625093","journal-title":"J. Global Optim."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1026552318150","volume":"18","author":"EPJ Boer","year":"2000","unstructured":"Boer, E.P.J., Hendrih, E.M.T.: Global optimization problems in optimal design of experiments in regression models. J. Global Optim. 18, 385\u2013398 (2000). https:\/\/doi.org\/10.1023\/A:1026552318150","journal-title":"J. Global Optim."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01096531","volume":"4","author":"I Bomze","year":"1994","unstructured":"Bomze, I., Danninger, G.: A finite algorithm for solving general quadratic problem. J. Global Optim. 4(1), 1\u201316 (1994). https:\/\/doi.org\/10.1007\/BF01096531","journal-title":"J. Global Optim."},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-35447-5","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"J-F Bonnans","year":"2006","unstructured":"Bonnans, J.-F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: Numerical Optimization: Theoretical and Practical Aspects, 2nd edn. Springer-Verlag, Heidelberg (2006). https:\/\/doi.org\/10.1007\/978-3-540-35447-5","edition":"2"},{"issue":"2","key":"7_CR5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.3934\/jimo.2017063","volume":"14","author":"R Enkhbat","year":"2018","unstructured":"Enkhbat, R., Gruzdeva, T.V., Barkova, M.V.: D.C. programming approach for solving an applied ore-processing problem. J. Ind. Manag. Optim. 14(2), 613\u2013623 (2018)","journal-title":"J. Ind. Manag. Optim."},{"key":"7_CR6","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, New-York (1972)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1134\/S0965542507030049","volume":"47","author":"TV Gruzdeva","year":"2007","unstructured":"Gruzdeva, T.V., Strekalovsky, A.S.: Local Search in Problems with Nonconvex Constraints. Comput. Math. Math. Phys. 47, 381\u2013396 (2007). https:\/\/doi.org\/10.1134\/S0965542507030049","journal-title":"Comput. Math. Math. Phys."},{"key":"7_CR8","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). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_32"},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer-Verlag, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-662-02796-7"},{"key":"7_CR10","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"1995","unstructured":"Horst, R., Pardalos, P., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Handbook of Global Optimization","author":"R Horst","year":"1995","unstructured":"Horst, R., Pardalos, P.M.: Handbook of Global Optimization. Kluwer Academic, Dordrecht (1995)"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","year":"1987","unstructured":"Pardalos, P.M., Rosen, J.B. (eds.): Constrained Global Optimization: Algorithms and Applications. LNCS, vol. 268. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0000035"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M., Schnitger, J.: Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7, 33\u201335 (1988)","journal-title":"Oper. Res. Lett."},{"key":"7_CR15","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). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_36"},{"key":"7_CR16","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":"7_CR17","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). https:\/\/doi.org\/10.1007\/978-1-4939-0808-0_23"},{"key":"7_CR18","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":"7_CR19","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). https:\/\/doi.org\/10.1007\/s11590-017-1214-x","journal-title":"Optim. Lett."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/B:AURC.0000019368.45522.7a","volume":"65","author":"AS Strekalovsky","year":"2004","unstructured":"Strekalovsky, A.S., Yakovleva, T.V.: On a local and global search involved in nonconvex optimization problems. Autom. Remote Control. 65, 375\u2013387 (2004). https:\/\/doi.org\/10.1023\/B:AURC.0000019368.45522.7a","journal-title":"Autom. Remote Control."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"PD Tao","year":"2005","unstructured":"Tao, P.D., Le Thi, H.A.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005). https:\/\/doi.org\/10.1007\/s10479-004-5022-1","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/0022-247X(78)90243-3","volume":"66","author":"JF Toland","year":"1978","unstructured":"Toland, J.F.: Duality in nonconvex optimization. J. Math. Anal. Appl. 66(2), 399\u2013415 (1978)","journal-title":"J. Math. Anal. Appl."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1008293029350","volume":"13","author":"Y Yajima","year":"1998","unstructured":"Yajima, Y., Fujie, T.A.: Polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Global Optim. 13, 151\u2013170 (1998). https:\/\/doi.org\/10.1023\/A:1008293029350","journal-title":"J. Global Optim."}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T18:07:39Z","timestamp":1667153259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_7","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)"}}]}}