{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T03:47:08Z","timestamp":1762660028531,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T00:00:00Z","timestamp":1613174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T00:00:00Z","timestamp":1613174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["grant 305223\/2015-1"],"award-info":[{"award-number":["grant 305223\/2015-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["grant 303799\/2018-8"],"award-info":[{"award-number":["grant 303799\/2018-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10898-020-00989-7","type":"journal-article","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T13:43:26Z","timestamp":1613310206000},"page":"919-966","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Integer programming formulations and efficient local search for relaxed correlation clustering"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3836-0725","authenticated-orcid":false,"given":"Eduardo","family":"Queiroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosa","family":"Figueiredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Frota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"key":"989_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.04.002","volume":"211","author":"Z Ales","year":"2016","unstructured":"Ales, Z., Knippel, A., Pauchet, A.: Polyhedral combinatorics of the $$k$$-partitioning problem with representative variables. Discret. Appl. Math. 211, 1\u201314 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"989_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0038135","volume":"7","author":"C Altafini","year":"2012","unstructured":"Altafini, C.: Dynamics of opinion forming in structurally balanced social networks. PLoS ONE 7(6), 1\u20139 (2012)","journal-title":"PLoS ONE"},{"key":"989_CR3","unstructured":"Arinik, N., Figueiredo, R., Labatut, V.: Signed Graph Analysis for the Interpretation of Voting Behavior. In: International Conference on Knowledge Technologies and Data-driven Business (i-KNOW), Graz, Austria, International Workshop on Social Network Analysis and Digital Humanities (SnanDig) (2017)"},{"key":"989_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.endm.2009.11.057","volume":"35","author":"L Bahiense","year":"2009","unstructured":"Bahiense, L., Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C.: A branch-and-cut algorithm for equitable coloring based on a formulation by representatives. Electron. Notes Discret. Math. 35, 347\u2013352 (2009)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"989_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"989_CR6","doi-asserted-by":"crossref","unstructured":"Beier, T., Hamprecht, F.A., Kappes, J.H.: Fusion moves for correlation clustering. In: CVPR. Proceedings, pp 3507\u20133516, 1 (2015)","DOI":"10.1109\/CVPR.2015.7298973"},{"key":"989_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-32147-4_26","volume-title":"Combinatorial Optimization","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Nguyen, V.H., Klein, M., Minoux, M.: On the solution of a graph partitioning problem under capacity constraints. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) Combinatorial Optimization, pp. 285\u2013296. Springer, Berlin (2012)"},{"issue":"3","key":"989_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0012-365X(84)90161-4","volume":"49","author":"AZ Broder","year":"1984","unstructured":"Broder, A.Z.: The r-stirling numbers. Discret. Math. 49(3), 241\u2013259 (1984)","journal-title":"Discret. Math."},{"issue":"1","key":"989_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1177\/0049124110384947","volume":"40","author":"M Brusco","year":"2011","unstructured":"Brusco, M., Doreian, P., Mrvar, A., Steinley, D.: Two algorithms for relaxed structural balance partitioning: linking theory, models, and data to understand social network phenomena. Sociol. Methods Res. 40(1), 57\u201387 (2011)","journal-title":"Sociol. Methods Res."},{"key":"989_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.socnet.2018.08.007","volume":"56","author":"MJ Brusco","year":"2019","unstructured":"Brusco, M.J., Doreian, P.: Partitioning signed networks using relocation heuristics, tabu search, and variable neighborhood search. Soc. Netw. 56, 70\u201380 (2019)","journal-title":"Soc. Netw."},{"key":"989_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2016.10.026","volume":"219","author":"T Bulh\u00f5es","year":"2017","unstructured":"Bulh\u00f5es, T., de Sousa Filho, G.F., Subramanian, A., Luc\u00eddio dos Anjos, F.C.: Branch-and-cut approaches for p-cluster editing. Discret. Appl. Math. 219, 51\u201364 (2017)","journal-title":"Discret. Appl. Math."},{"key":"989_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/j.dam.2007.05.058","volume":"156","author":"M Camp\u00ealo","year":"2008","unstructured":"Camp\u00ealo, M., Campos, V.A., Correa, R.C.: On the asymmetric representatives formulation for the vertex coloring problem. Discret. Appl. Math. 156, 1097\u20131111 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"989_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2003.11.005","volume":"89","author":"MB Camp\u00ealo","year":"2004","unstructured":"Camp\u00ealo, M.B., Corr\u00eaa, R.C., Frota, Y.: Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89(4), 159\u2013164 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"989_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of heider\u2019s theory. Psychol. Rev. 63(5), 277 (1956)","journal-title":"Psychol. Rev."},{"issue":"5","key":"989_CR15","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1890\/0012-9658(2002)083[1372:ROCSIA]2.0.CO;2","volume":"83","author":"JM Dambacher","year":"2002","unstructured":"Dambacher, J.M., Li, H.W., Rossignol, P.A.: Relevance of community structure in assessing indeterminacy of ecological predictions. Ecology 83(5), 1372\u20131385 (2002)","journal-title":"Ecology"},{"key":"989_CR16","first-page":"161","volume":"90","author":"B DasGupta","year":"2007","unstructured":"DasGupta, B., AEnciso, G., Sontag, E., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Bio. Syst. 90, 161\u2013178 (2007)","journal-title":"Bio. Syst."},{"issue":"2","key":"989_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1177\/001872676702000206","volume":"20","author":"JA Davis","year":"1967","unstructured":"Davis, J.A.: Clustering and structural balance in graphs. Hum. Relat. 20(2), 181\u2013187 (1967)","journal-title":"Hum. Relat."},{"issue":"3","key":"989_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.socnet.2008.03.005","volume":"30","author":"P Doreian","year":"2008","unstructured":"Doreian, P.: A multiple indicator approach to blockmodeling signed networks. Soc. Netw. 30(3), 247\u2013258 (2008)","journal-title":"Soc. Netw."},{"issue":"2","key":"989_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0378-8733(95)00259-6","volume":"18","author":"P Doreian","year":"1996","unstructured":"Doreian, P., Mrvar, A.: A partitioning approach to structural balance. Soc. Netw. 18(2), 149\u2013168 (1996)","journal-title":"Soc. Netw."},{"issue":"1","key":"989_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.socnet.2008.08.001","volume":"31","author":"P Doreian","year":"2009","unstructured":"Doreian, P., Mrvar, A.: Partitioning signed social networks. Soc. Netw. 31(1), 1\u201311 (2009)","journal-title":"Soc. Netw."},{"key":"989_CR21","doi-asserted-by":"crossref","unstructured":"Doreian, P., Mrvar, A.: Testing two theories for generating signed networks using real data (2014)","DOI":"10.51936\/luiz1097"},{"key":"989_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.21307\/joss-2019-012","volume":"16","author":"P Doreian","year":"2015","unstructured":"Doreian, P., Mrvar, A.: Structural balance and signed international relations. J. Soc. Struct. 16, 2 (2015)","journal-title":"J. Soc. Struct."},{"issue":"52","key":"989_CR23","doi-asserted-by":"publisher","first-page":"20953","DOI":"10.1073\/pnas.1109521108","volume":"108","author":"G Facchetti","year":"2011","unstructured":"Facchetti, G., Iacono, G., Altafini, C.: Computing global structural balance in large-scale signed social networks. Proc. Natl. Acad. Sci. 108(52), 20953\u201320958 (2011)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"989_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10898-009-9520-1","volume":"48","author":"N Fan","year":"2010","unstructured":"Fan, N., Pardalos, P.M.: Linear and quadratic programming approaches for the general graph partitioning problem. J. Glob. Optim. 48(1), 57\u201371 (2010)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"989_CR25","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.ejor.2013.12.036","volume":"236","author":"R Figueiredo","year":"2014","unstructured":"Figueiredo, R., Frota, Y.: The maximum balanced subgraph of a signed graph: applications and solution approaches. Eur. J. Oper. Res. 236(2), 473\u2013487 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"989_CR26","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.socnet.2013.09.002","volume":"35","author":"R Figueiredo","year":"2013","unstructured":"Figueiredo, R., Moura, G.: Mixed integer programming formulations for clustering problems related to structural balance. Soc. Netw. 35(4), 639\u2013651 (2013)","journal-title":"Soc. Netw."},{"key":"989_CR27","first-page":"5","volume":"2","author":"R Figueiredo","year":"2018","unstructured":"Figueiredo, R., Frota, Y., Labb\u00e9, M.: A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. Discret. Appl. Math. 2, 5 (2018)","journal-title":"Discret. Appl. Math."},{"key":"989_CR28","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/net.20365","volume":"55","author":"Y Frota","year":"2010","unstructured":"Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C.: A branch-and-cut algorithm for partition coloring. Network 55, 194\u2013204 (2010)","journal-title":"Network"},{"key":"989_CR29","first-page":"1","volume":"13","author":"F Harary","year":"2003","unstructured":"Harary, F., Lim, M., Wunsch, D.C.: Signed graphs for portfolio analysis in risk management. IMA J. Manag. Math. 13, 1\u201310 (2003)","journal-title":"IMA J. Manag. Math."},{"issue":"1","key":"989_CR30","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/00223980.1946.9917275","volume":"21","author":"F Heider","year":"1946","unstructured":"Heider, F.: Attitudes and cognitive organization. J. Psychol. 21(1), 107\u2013112 (1946). pMID: 21010780","journal-title":"J. Psychol."},{"key":"989_CR31","first-page":"1530","volume-title":"Advances in Neural Information Processing Systems","author":"S Kim","year":"2011","unstructured":"Kim, S., Nowozin, S., Kohli, P., Yoo, C.D.: Higher-order correlation clustering for image segmentation. In: Shawe-Taylor, J., Zemel, R.S., Bartlett, P.L., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24, pp. 1530\u20131538. Current Associates Inc., New York (2011)"},{"issue":"1\/2","key":"989_CR32","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2307\/2785447","volume":"15","author":"TB Lemann","year":"1952","unstructured":"Lemann, T.B., Solomon, R.L.: Group characteristics as revealed in sociometric patterns and personality ratings. Sociom 15(1\/2), 7\u201390 (1952)","journal-title":"Sociom"},{"key":"989_CR33","unstructured":"Levorato, M.: Efficient solutions to the correlation clustering problem. Master\u2019s thesis, Universidade Federal Fluminense, Niter\u00f3i, Rio de Janeiro, Brazil, (2015). http:\/\/www.ic.uff.br\/PosGraduacao\/frontend-tesesdissertacoes\/download.php?id=700.pdf&tipo=trabalho"},{"key":"989_CR34","first-page":"10","volume":"3","author":"M Levorato","year":"2017","unstructured":"Levorato, M., Frota, Y.: Brazilian congress structural balance analysis. J. Interdiscip. Methodol. Issues Sci. 3, 10 (2017)","journal-title":"J. Interdiscip. Methodol. Issues Sci."},{"key":"989_CR35","doi-asserted-by":"crossref","unstructured":"Levorato, M., Drummond, L., Frota, Y., Figueiredo, R.: An ils algorithm to evaluate structural balance in signed social networks. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, ACM, New York, SAC \u201915, pp 1117\u20131122 (2015)","DOI":"10.1145\/2695664.2695689"},{"issue":"4","key":"989_CR36","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s13675-017-0082-6","volume":"5","author":"M Levorato","year":"2017","unstructured":"Levorato, M., Figueiredo, R., Frota, Y., Drummond, L.: Evaluating balancing on social networks through the efficient solution of correlation clustering problems. EURO J. Comput. Optim. 5(4), 467\u2013498 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"989_CR37","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: Framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 363\u2013397. Springer, Boston (2010)"},{"issue":"5","key":"989_CR38","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.engappai.2004.03.007","volume":"17","author":"MR Maurya","year":"2004","unstructured":"Maurya, M.R., Rengaswamy, R., Venkatasubramanian, V.: Application of signed digraphs-based analysis for fault diagnosis of chemical process flowsheets. Eng. Appl. Artif. Intell. 17(5), 501\u2013518 (2004)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"989_CR39","doi-asserted-by":"publisher","first-page":"356","DOI":"10.2307\/2785196","volume":"11","author":"JC McKinney","year":"1948","unstructured":"McKinney, J.C.: An educational application of a two-dimensional sociometric test. Sociom 11(4), 356\u2013367 (1948)","journal-title":"Sociom"},{"issue":"11","key":"989_CR40","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"989_CR41","doi-asserted-by":"publisher","DOI":"10.1037\/13156-000","volume-title":"The Acquaintance Process","author":"TM Newcomb","year":"1961","unstructured":"Newcomb, T.M.: The Acquaintance Process. Holt, Rinehart & Winston, New York (1961)"},{"key":"989_CR42","unstructured":"Sampson, S.F.: A novitiate in a period of change: an experimental and case study of social relationships. Ph.D. thesis, Department of Sociology, Cornell University, NY (1968)"},{"issue":"3","key":"989_CR43","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"989_CR44","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2014.08.005","volume":"53","author":"MM Silva","year":"2015","unstructured":"Silva, M.M., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the split delivery vehicle routing problem. Comput. Oper. Res. 53, 234\u2013249 (2015)","journal-title":"Comput. Oper. Res."},{"key":"989_CR45","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2016.10.008","volume":"79","author":"A Subramanian","year":"2017","unstructured":"Subramanian, A., Farias, K.: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. Comput. Oper. Res. 79, 190\u2013206 (2017)","journal-title":"Comput. Oper. Res."},{"key":"989_CR46","unstructured":"Van\u00a0Gael, J., Zhu, X.: Correlation clustering for crosslingual link detection. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, IJCAI\u201907, pp. 1744\u20131749 (2007)"},{"key":"989_CR47","doi-asserted-by":"crossref","unstructured":"Vasanthi, B., Arumugam, S., Nagar, A.K., Mitra, S.: Applications of signed graphs to portfolio turnover analysis. In: 2nd Global Conference on Business and Social Sciences (GCBSS-2015) on \u201cMultidisciplinary Perspectives on Management and Society\u201d, 2015, Bali, Indonesia (2015)","DOI":"10.1016\/j.sbspro.2015.11.160"},{"key":"989_CR48","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-53914-5_30","volume-title":"Advanced Data Mining and Applications","author":"N Wang","year":"2013","unstructured":"Wang, N., Li, J.: Restoring: a greedy heuristic approach based on neighborhood for correlation clustering. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) Advanced Data Mining and Applications, pp. 348\u2013359. Springer, Berlin (2013)"},{"key":"989_CR49","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"B Yang","year":"2007","unstructured":"Yang, B., Cheung, W., Liu, J.: Community mining from signed social networks. IEEE Trans. Knowl. Data Eng. 19, 1333\u20131348 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"989_CR50","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discret. Appl. Math. 4, 47\u201374 (1982)","journal-title":"Discret. Appl. Math."},{"key":"989_CR51","first-page":"8","volume":"3","author":"T Zaslavsky","year":"1998","unstructured":"Zaslavsky, T.: A mathematical bibliography of signed and gain graphs and allied areas. Electron. J. Comb. DS 3, 8 (1998)","journal-title":"Electron. J. Comb. DS"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00989-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00989-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00989-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:46:04Z","timestamp":1697867164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00989-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,13]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["989"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00989-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,2,13]]},"assertion":[{"value":"6 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The datasets analysed during the current study are available from the corresponding author on reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}}]}}