{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:51:34Z","timestamp":1771955494205,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T00:00:00Z","timestamp":1550620800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J010537\/1"],"award-info":[{"award-number":["EP\/J010537\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J010537\/1"],"award-info":[{"award-number":["EP\/J010537\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M002454\/1"],"award-info":[{"award-number":["EP\/M002454\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Clarendon Scholarship"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-019-01366-3","type":"journal-article","created":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T18:50:29Z","timestamp":1550688629000},"page":"489-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Chordal decomposition in operator-splitting methods for sparse semidefinite programs"],"prefix":"10.1007","volume":"180","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1545-231X","authenticated-orcid":false,"given":"Yang","family":"Zheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0808-0944","authenticated-orcid":false,"given":"Giovanni","family":"Fantuzzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3565-8967","authenticated-orcid":false,"given":"Antonis","family":"Papachristodoulou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0456-4124","authenticated-orcid":false,"given":"Paul","family":"Goulart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2338-5903","authenticated-orcid":false,"given":"Andrew","family":"Wynn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,20]]},"reference":[{"key":"1366_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J Agler","year":"1988","unstructured":"Agler, J., Helton, W., McCullough, S., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101\u2013149 (1988)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1366_CR2","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"key":"1366_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, M., Dahl, J., Liu, Z., Vandenberghe, L.: Interior-point methods for large-scale cone programming. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning, pp. 55\u201383. MIT Press (2011)","DOI":"10.7551\/mitpress\/8996.003.0005"},{"issue":"3\u20134","key":"1366_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s12532-010-0016-2","volume":"2","author":"MS Andersen","year":"2010","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones. Math. Program. Comput. 2(3\u20134), 167\u2013201 (2010)","journal-title":"Math. Program. Comput."},{"key":"1366_CR5","unstructured":"Banjac, G., Goulart, P., Stellato, B., Boyd, S.: Infeasibility detection in the alternating direction method of multipliers for convex optimization. optimization-online.org. http:\/\/www.optimization-online.org\/DB_HTML\/2017\/06\/6058.html (2017). Accessed July 2017"},{"key":"1366_CR6","doi-asserted-by":"crossref","unstructured":"Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer (1993)","DOI":"10.1007\/978-1-4613-8369-7_1"},{"issue":"1\u20134","key":"1366_CR7","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11(1\u20134), 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1366_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"issue":"1","key":"1366_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"Stephen Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends $${\\textregistered }$$ \u00ae Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"1366_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"1366_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/S105262340240851X","volume":"14","author":"S Burer","year":"2003","unstructured":"Burer, S.: Semidefinite programming in the space of partial positive semidefinite matrices. SIAM J. Optim. 14(1), 139\u2013172 (2003)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1366_CR12","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1109\/TSG.2013.2248175","volume":"4","author":"E Dall\u2019Anese","year":"2013","unstructured":"Dall\u2019Anese, E., Zhu, H., Giannakis, G.B.: Distributed optimal power flow for smart microgrids. IEEE Trans. Smart Grid 4(3), 1464\u20131475 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"key":"1366_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"T Davis","year":"2006","unstructured":"Davis, T.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"issue":"1","key":"1366_CR14","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"1366_CR15","doi-asserted-by":"crossref","unstructured":"F\u00e4lt, M., Giselsson, P.: Line search for generalized alternating projections. arXiv preprint arXiv:1609.05920 (2016)","DOI":"10.23919\/ACC.2017.7963671"},{"key":"1366_CR16","unstructured":"Fujisawa, K., Kim, S., Kojima, M., Okamoto, Y., Yamashita, M.: User\u2019s manual for SparseCoLO: conversion methods for sparse conic-form linear optimization problems. Tech. rep., Research Report B-453, Tokyo Institute of Technology, Tokyo 152-8552, Japan (2009)"},{"issue":"3","key":"1366_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11(3), 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1366_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"1366_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TAC.2014.2354892","volume":"60","author":"E Ghadimi","year":"2015","unstructured":"Ghadimi, E., Teixeira, A., Shames, I., Johansson, M.: Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems. IEEE Trans. Autom. Control 60(3), 644\u2013658 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"1366_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. Revue fran\u00e7aise d\u2019automatique, informatique, recherche op\u00e9rationnelle. Analyse Num\u00e9rique 9(2), 41\u201376 (1975)","journal-title":"Analyse Num\u00e9rique"},{"key":"1366_CR21","volume-title":"Algebraic Graph Theory","author":"C Godsil","year":"2013","unstructured":"Godsil, C., Royle, G.F.: Algebraic Graph Theory. Springer, Berlin (2013)"},{"issue":"1","key":"1366_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02612711","volume":"28","author":"A Griewank","year":"1984","unstructured":"Griewank, A., Toint, P.L.: On the existence of convex decompositions of partially separable functions. Math. Program. 28(1), 25\u201349 (1984)","journal-title":"Math. Program."},{"key":"1366_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1366_CR24","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1366_CR25","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.laa.2010.04.012","volume":"433","author":"N Kakimura","year":"2010","unstructured":"Kakimura, N.: A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices. Linear Algebra Appl. 433(4), 819\u2013823 (2010)","journal-title":"Linear Algebra Appl."},{"key":"1366_CR26","doi-asserted-by":"crossref","unstructured":"Kalbat, A., Lavaei, J.: A fast distributed algorithm for decomposable semidefinite programs. In: Proc. 54th IEEE Conf. Decis. Control, pp. 1742\u20131749 (2015)","DOI":"10.1109\/CDC.2015.7402462"},{"issue":"1","key":"1366_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2011","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1), 33\u201368 (2011)","journal-title":"Math. Program."},{"key":"1366_CR28","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ryu, E.K., Yin, W.: A new use of douglas-rachford splitting and ADMM for identifying infeasible, unbounded, and pathological conic programs. arXiv preprint arXiv:1706.02374 (2017)","DOI":"10.1007\/s10107-018-1265-5"},{"key":"1366_CR29","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: IEEE International Symposium on Computer Aided Control System Design, pp. 284\u2013289. IEEE (2004)"},{"key":"1366_CR30","doi-asserted-by":"crossref","unstructured":"Madani, R., Kalbat, A., Lavaei, J.: ADMM for sparse semidefinite programming with applications to optimal power flow problem. In: Proceedings of 54th IEEE Conference on Decision and Control, pp. 5932\u20135939 (2015)","DOI":"10.1109\/CDC.2015.7403152"},{"issue":"1","key":"1366_CR31","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20(1), 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1366_CR32","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1366_CR33","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: SCS: splitting conic solver, version 1.2.6. https:\/\/github.com\/cvxgrp\/scs (2016). Accessed Sept 2016"},{"key":"1366_CR34","unstructured":"Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., Parrilo, P.: SOSTOOLS version 3.00 sum of squares optimization toolbox for MATLAB. arXiv preprint arXiv:1310.4716 (2013)"},{"key":"1366_CR35","doi-asserted-by":"crossref","unstructured":"Raghunathan, A.U., Di\u00a0Cairano, S.: Alternating direction method of multipliers for strictly convex quadratic programs: optimal parameter selection. In: Proceedings of the American Control Conference, pp. 4324\u20134329. IEEE (2014)","DOI":"10.1109\/ACC.2014.6859093"},{"key":"1366_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)"},{"issue":"1\u20134","key":"1366_CR37","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using 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."},{"issue":"2","key":"1366_CR38","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/130926924","volume":"24","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Andersen, M.S., Vandenberghe, L.: Decomposition in conic optimization with partially separable structure. SIAM J. Optim. 24(2), 873\u2013897 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1366_CR39","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1137\/15M1011020","volume":"36","author":"Y Sun","year":"2015","unstructured":"Sun, Y., Vandenberghe, L.: Decomposition methods for sparse matrix nearness problems. SIAM J. Matrix Anal. Appl. 36(4), 1691\u20131717 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1366_CR40","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"1366_CR41","unstructured":"Themelis, A., Patrinos, P.: SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators. arXiv preprint arXiv:1609.06955 (2016)"},{"issue":"4","key":"1366_CR42","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"Lieven Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.S.: Chordal graphs and semidefinite optimization. Found. Trends $${\\textregistered }$$ \u00ae Optim. 1(4), 241\u2013433 (2014)","journal-title":"Foundations and Trends\u00ae in Optimization"},{"issue":"1","key":"1366_CR43","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"3\u20134","key":"1366_CR44","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3\u20134), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"key":"1366_CR45","doi-asserted-by":"crossref","unstructured":"Yan, M., Yin, W.: Self equivalence of the alternating direction method of multipliers. In: Glowinski, R., Osher, S.J., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 165\u2013194. Springer (2016)","DOI":"10.1007\/978-3-319-41589-5_5"},{"key":"1366_CR46","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebr. Discrete Methods 2, 77\u201379 (1981)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"1366_CR47","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, Hoboken (2011)"},{"issue":"1","key":"1366_CR48","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$\\cal{O}\\sqrt{n} l $$ O n l -iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1366_CR49","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1366_CR50","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/LCSYS.2017.2706941","volume":"1","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A.: Exploiting sparsity in the coefficient matching conditions in sum-of-squares programming using ADMM. IEEE Control Syst. Lett. 1(1), 80\u201385 (2017)","journal-title":"IEEE Control Syst. Lett."},{"issue":"1","key":"1366_CR51","doi-asserted-by":"publisher","first-page":"8411","DOI":"10.1016\/j.ifacol.2017.08.1569","volume":"50","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Fast ADMM for homogeneous self-dual embedding of sparse SDPs. IFAC PapersOnLine 50(1), 8411\u20138416 (2017)","journal-title":"IFAC PapersOnLine"},{"key":"1366_CR52","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Fast ADMM for semidefinite programs with chordal sparsity. In: Proceedings of the American Control Conference, pp. 3335\u20133340. IEEE (2017)","DOI":"10.23919\/ACC.2017.7963462"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01366-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01366-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01366-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:28:18Z","timestamp":1694636898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01366-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,20]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1366"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01366-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,20]]},"assertion":[{"value":"9 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}