{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:19:14Z","timestamp":1780985954322,"version":"3.54.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12288201"],"award-info":[{"award-number":["12288201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10107-022-01878-5","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T14:02:32Z","timestamp":1661004152000},"page":"105-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Homogenization for polynomial optimization with unbounded sets"],"prefix":"10.1007","volume":"200","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9734-5387","authenticated-orcid":false,"given":"Lei","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawang","family":"Nie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ya-Xiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"key":"1878_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-019-01411-1","volume":"184","author":"AA Ahmadi","year":"2020","unstructured":"Ahmadi, A.A., Zhang, J.: On the complexity of testing attainment of the optimal value in nonlinear optimization. Math. Program. 184, 221\u2013241 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"1878_CR2","doi-asserted-by":"crossref","first-page":"1542","DOI":"10.1137\/140980624","volume":"25","author":"T Bajbar","year":"2015","unstructured":"Bajbar, T., Stein, O.: Coercive polynomials and their newton polytopes. SIAM J. Optim. 25(3), 1542\u20131570 (2015)","journal-title":"SIAM J. Optim."},{"key":"1878_CR3","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1995","unstructured":"Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1995)","edition":"2"},{"key":"1878_CR4","first-page":"189","volume":"54","author":"R Curto","year":"2005","unstructured":"Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"issue":"1","key":"1878_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jpaa.2006.05.028","volume":"209","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Nie, J., Powers, V.: Representations of positive polynomials on non-compact semialgebraic sets via KKT ideals. J. Pure Appl. Algebra 209(1), 189\u2013200 (2007)","journal-title":"J. Pure Appl. Algebra"},{"key":"1878_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-019-00066-0","volume":"73","author":"P Dickinson","year":"2019","unstructured":"Dickinson, P., Povh, J.: A new approximation hierarchy for polynomial conic optimization. Comput. Optim. Appl. 73, 37\u201367 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1878_CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10107-017-1167-y","volume":"170","author":"J Fan","year":"2018","unstructured":"Fan, J., Nie, J., Zhou, A.: Tensor eigenvalue complementarity problems. Math. Program. 170(2), 507\u2013539 (2018)","journal-title":"Math. Program."},{"key":"1878_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10107-020-01537-7","volume":"190","author":"K Fang","year":"2021","unstructured":"Fang, K., Fawzi, H.: The sum-of-squares hierarchy on the sphere and applications in quantum information theory. Math. Program. 190, 331\u2013360 (2021)","journal-title":"Math. Program."},{"key":"1878_CR9","doi-asserted-by":"crossref","unstructured":"Gelfand, I., Kapranov, M., Zelevinsky, A.: Discriminants, resultants, and multidimensional determinants. Theory & applications, Birkh\u00e4user, Mathematics (1994)","DOI":"10.1007\/978-0-8176-4771-1"},{"issue":"2","key":"1878_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10898-013-0047-0","volume":"58","author":"F Guo","year":"2014","unstructured":"Guo, F., Wang, L., Zhou, G.: Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities. J. Global Optim. 58(2), 261\u2013284 (2014)","journal-title":"J. Global Optim."},{"issue":"11","key":"1878_CR11","doi-asserted-by":"crossref","first-page":"2167","DOI":"10.1016\/j.jpaa.2009.03.014","volume":"213","author":"H Ha","year":"2009","unstructured":"Ha, H., Pham, T.: Solving polynomial optimization problems via the truncated tangency variety and sums of squares. J. Pure Appl. Algebra 213(11), 2167\u20132176 (2009)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"1878_CR12","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1137\/080719212","volume":"19","author":"H Ha","year":"2008","unstructured":"Ha, H., Pham, T.: Global optimization of polynomials using the truncated tangency variety and sums of squares. SIAM J. Optim. 19(2), 941\u2013951 (2008)","journal-title":"SIAM J. Optim."},{"key":"1878_CR13","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in Gloptipoly. In Positive polynomials in control, 293.C310, Lecture Notes in Control and Inform. Sci., 312, Springer (2005)","DOI":"10.1007\/10997703_15"},{"issue":"4\u20135","key":"1878_CR14","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., Loefberg, J.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1878_CR15","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s10957-014-0545-3","volume":"163","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Lasserre, J., Li, G.: On polynomial optimization over non-compact semi-algebraic sets. J. Optim. Theory Appl. 163(3), 707\u2013718 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1878_CR16","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1137\/100814147","volume":"21","author":"E De Klerk","year":"2011","unstructured":"De Klerk, E., Laurent, M.: On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21, 824\u2013832 (2011)","journal-title":"SIAM J. Optim."},{"key":"1878_CR17","doi-asserted-by":"crossref","unstructured":"De Klerk E., Laurent M., Parrilo P.: On the equivalence of algebraic approaches to the minimization of forms on the simplex. In: Henrion D., Garulli A. (eds) Positive Polynomials in Control. Lecture Notes in Control and Information Science, vol 312. Springer (2005)","DOI":"10.1007\/10997703_7"},{"issue":"3","key":"1878_CR18","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1287\/moor.2016.0829","volume":"42","author":"E De Klerk","year":"2017","unstructured":"De Klerk, E., Lasserre, J., Laurent, M., Sun, Z.: Bound-constrained polynomial optimization using only elementary calculations. Math. Oper. Res. 42(3), 834\u2013853 (2017)","journal-title":"Math. Oper. Res."},{"key":"1878_CR19","doi-asserted-by":"crossref","unstructured":"De Klerk, E., Laurent, M.: Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193(2), 665\u2013685 (2022)","DOI":"10.1007\/s10107-019-01465-1"},{"issue":"4","key":"1878_CR20","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E De Klerk","year":"2002","unstructured":"De Klerk, E., Pasechnik, D.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1878_CR21","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1878_CR22","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s10208-007-9004-y","volume":"8","author":"J Lasserre","year":"2008","unstructured":"Lasserre, J., Laurent, M., Rostalski, P.: Semidefinite characterization and computation of zero-dimensional real radical ideals. Found. Comput. Math. 8, 607\u2013647 (2008)","journal-title":"Found. Comput. Math."},{"key":"1878_CR23","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"J Lasserre","year":"2009","unstructured":"Lasserre, J.: Convexity in semi-algebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"1878_CR24","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/100806990","volume":"21","author":"J Lasserre","year":"2011","unstructured":"Lasserre, J.: A new look at nonnegativity on closed sets and polynomial optimization. SIAM J. Optim. 21, 864\u2013885 (2011)","journal-title":"SIAM J. Optim."},{"key":"1878_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-algebraic Optimization","author":"J Lasserre","year":"2015","unstructured":"Lasserre, J.: An Introduction to Polynomial and Semi-algebraic Optimization. Cambridge University Press, Cambridge (2015)"},{"key":"1878_CR26","doi-asserted-by":"crossref","unstructured":"Lasserre, J.: The Moment-SOS hierarchy. In: Sirakov, B., Ney de Souza., P., Viana, M. (eds.) Proceedings of the International Congress of Mathematicians (ICM 2018), vol\u00a03, pp. 3761\u20133784, World Scientific (2019)","DOI":"10.1142\/9789813272880_0200"},{"issue":"10","key":"1878_CR27","doi-asserted-by":"crossref","first-page":"2965","DOI":"10.1090\/S0002-9939-05-08133-5","volume":"133","author":"M Laurent","year":"2005","unstructured":"Laurent, M.: Revisiting two theorems of Curto and Fialkow on moment matrices. Proc. Am. Math. Soc. 133(10), 2965\u20132976 (2005)","journal-title":"Proc. Am. Math. Soc."},{"key":"1878_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109, 1\u201326 (2007)","journal-title":"Math. Program."},{"key":"1878_CR29","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging applications of algebraic geometry of IMA Volumes in Mathematics and its Applications, 149: 157\u2013270. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"1878_CR30","unstructured":"Laurent, M.: Optimization over polynomials: Selected topics. In: Jang, S., Kim, Y., Lee, D.W., Yie, I. (eds.) Proceedings of the International Congress of Mathematicians ( ICM 2014), pp. 843\u2013869 (2014)"},{"key":"1878_CR31","doi-asserted-by":"crossref","unstructured":"Mai, N., Magron, V.: On the complexity of Putinar-Vasilescu\u2019s Positivstellensatz. arXiv preprint, arXiv:2104.11606 (2021)","DOI":"10.1016\/j.jco.2022.101663"},{"key":"1878_CR32","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-021-01634-1","volume":"194","author":"N Mai","year":"2021","unstructured":"Mai, N., Lasserre, J., Magron, V.: Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194, 443\u2013485 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"1878_CR33","doi-asserted-by":"crossref","first-page":"400","DOI":"10.4153\/CMB-2003-041-9","volume":"46","author":"M Marshall","year":"2003","unstructured":"Marshall, M.: Optimization of polynomial functions. Can. Math. Bull. 46(3), 400\u2013418 (2003)","journal-title":"Can. Math. Bull."},{"key":"1878_CR34","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/146","volume-title":"Positive Polynomials and Sums of Squares","author":"M Marshall","year":"2008","unstructured":"Marshall, M.: Positive Polynomials and Sums of Squares. American Mathematical Society, Providence (2008)"},{"key":"1878_CR35","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"3","key":"1878_CR36","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. 106(3), 587\u2013606 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1878_CR37","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.jsc.2011.08.023","volume":"47","author":"J Nie","year":"2012","unstructured":"Nie, J.: Discriminants and nonnegative polynomials. J. Symb. Comput. 47(2), 167\u2013191 (2012)","journal-title":"J. Symb. Comput."},{"issue":"1\u20132","key":"1878_CR38","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. 142(1\u20132), 485\u2013510 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1878_CR39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-011-0489-4","volume":"137","author":"J Nie","year":"2013","unstructured":"Nie, J.: An exact Jacobian SDP relaxation for polynomial optimization. Math. Program. 137(1\u20132), 225\u2013255 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"1878_CR40","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1137\/120898772","volume":"23","author":"J Nie","year":"2013","unstructured":"Nie, J.: Polynomial optimization with real varieties. SIAM J. Optim. 23(3), 1634\u20131646 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1878_CR41","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. 146(1\u20132), 97\u2013121 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1878_CR42","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10107-014-0845-2","volume":"151","author":"J Nie","year":"2015","unstructured":"Nie, J.: The hierarchy of local minimums in polynomial optimization. Math. Program. 151(2), 555\u2013583 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1878_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-018-1276-2","volume":"178","author":"J Nie","year":"2019","unstructured":"Nie, J.: Tight relaxations for polynomial optimization and Lagrange multiplier expressions. Math. Program. 178(1\u20132), 1\u201337 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"1878_CR44","doi-asserted-by":"crossref","first-page":"2902","DOI":"10.1137\/17M115308X","volume":"28","author":"J Nie","year":"2018","unstructured":"Nie, J., Yang, Z., Zhang, X.: A complete semidefinite algorithm for detecting copositive matrices and tensors. SIAM J. Optim. 28(4), 2902\u20132921 (2018)","journal-title":"SIAM J. Optim."},{"key":"1878_CR45","unstructured":"Pham, T.: Tangencies and polynomial optimization. arXiv preprint, arXiv:1902.06041 (2019)"},{"issue":"3","key":"1878_CR46","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"issue":"7","key":"1878_CR47","first-page":"585","volume":"328","author":"M Putinar","year":"1999","unstructured":"Putinar, M., Vasilescu, F.: Positive polynomials on semi-algebraic sets. C. R. Acad. Sci. Ser. I Math. 328(7), 585\u2013589 (1999)","journal-title":"C. R. Acad. Sci. Ser. I Math."},{"issue":"6","key":"1878_CR48","first-page":"495","volume":"328","author":"M Putinar","year":"1999","unstructured":"Putinar, M., Vasilescu, F.: Solving moment problems by dimensional extension. C. R. Acad. Sci. Ser. I Math. 328(6), 495\u2013499 (1999)","journal-title":"C. R. Acad. Sci. Ser. I Math."},{"key":"1878_CR49","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/conm\/253\/03936","volume":"253","author":"B Reznick","year":"2000","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. Contemp. Math. 253, 251\u2013272 (2000)","journal-title":"Contemp. Math."},{"key":"1878_CR50","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00229-006-0630-5","volume":"119","author":"C Scheiderer","year":"2006","unstructured":"Scheiderer, C.: Sums of squares on real algebraic surfaces. Manuscr. Math. 119, 395\u2013410 (2006)","journal-title":"Manuscr. Math."},{"key":"1878_CR51","doi-asserted-by":"crossref","unstructured":"Scheiderer, C.: Positivity and sums of squares: A guide to recent results. In: Emerging applications of algebraic geometry of IMA Volumes in Mathematics and its Applications, 149, pp. 271\u2013324. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_8"},{"issue":"3","key":"1878_CR52","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"M Schweighofer","year":"2005","unstructured":"Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805\u2013825 (2005)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1878_CR53","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1137\/050647098","volume":"17","author":"M Schweighofer","year":"2006","unstructured":"Schweighofer, M.: Global optimization of polynomials using gradient tentacles and sums of squares. SIAM J. Optim. 17(3), 920\u2013942 (2006)","journal-title":"SIAM J. Optim."},{"key":"1878_CR54","doi-asserted-by":"crossref","unstructured":"Slot, L., Laurent, M.: Improved convergence analysis of Lasserre\u2019s measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193(2), 831\u2013871 (2022)","DOI":"10.1007\/s10107-020-01468-3"},{"key":"1878_CR55","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"issue":"1\u20134","key":"1878_CR56","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: SeDuMi 1.02: a matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1878_CR57","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Solving systems of polynomial equations. In: CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence (2002)","DOI":"10.1090\/cbms\/097"},{"key":"1878_CR58","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.jalgebra.2016.03.050","volume":"459","author":"J Yu","year":"2016","unstructured":"Yu, J.: Do most polynomials generate a prime ideal? J. Algebra 459, 468\u2013474 (2016)","journal-title":"J. Algebra"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01878-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01878-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01878-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T23:06:36Z","timestamp":1684451196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01878-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1878"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01878-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"15 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}