{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T18:27:31Z","timestamp":1787077651131,"version":"3.56.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new MIPLIB 2017 collection consists of 1065 instances. A subset of 240 instances was specially selected for benchmarking solver performance. For the first time, these sets were compiled using a data-driven selection process supported by the solution of a sequence of mixed integer optimization problems, which encode requirements on diversity and balancedness with respect to instance features and performance data.\n<\/jats:p>","DOI":"10.1007\/s12532-020-00194-3","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T12:03:36Z","timestamp":1610021016000},"page":"443-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":170,"title":["MIPLIB 2017: data-driven compilation of the 6th\u00a0mixed-integer programming library"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7132-5142","authenticated-orcid":false,"given":"Gregor","family":"Hendel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6141-5937","authenticated-orcid":false,"given":"Gerald","family":"Gamrath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Achterberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4416-925X","authenticated-orcid":false,"given":"Michael","family":"Bastubbe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-8154","authenticated-orcid":false,"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3036-7239","authenticated-orcid":false,"given":"Philipp","family":"Christophel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kati","family":"Jarck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4442-3059","authenticated-orcid":false,"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-0522","authenticated-orcid":false,"given":"Marco","family":"L\u00fcbbecke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1961-657X","authenticated-orcid":false,"given":"Hans D.","family":"Mittelmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2943-7762","authenticated-orcid":false,"given":"Derya","family":"Ozyurt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4306-9089","authenticated-orcid":false,"given":"Ted K.","family":"Ralphs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0232-2244","authenticated-orcid":false,"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2902-882X","authenticated-orcid":false,"given":"Yuji","family":"Shinano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"194_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"194_CR2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0857","author":"T Achterberg","year":"2019","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"194_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"194_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"194_CR5","doi-asserted-by":"publisher","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: C.\u00a0Beeri, P.\u00a0Buneman (eds.) Database Theory\u2013ICDT\u201999, pp. 217\u2013235. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_15","DOI":"10.1007\/3-540-49257-7_15"},{"key":"194_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2016","unstructured":"Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Fr\u00e9chette, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., et al.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2016)","journal-title":"Artif. Intell."},{"issue":"1","key":"194_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002). https:\/\/doi.org\/10.1287\/opre.50.1.3.17780","journal-title":"Oper. Res."},{"key":"194_CR8","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"194_CR9","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C., Savelsbergh, M.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"key":"194_CR10","doi-asserted-by":"crossref","unstructured":"Browne, S., Dongarra, J., Grosse, E., Rowan, T.: The Netlib mathematical software repository. D-lib Magazine 1(9), (1995)","DOI":"10.1045\/september95-browne"},{"issue":"1","key":"194_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"194_CR12","unstructured":"COIN-OR branch-and-cut MIP solver (2019). https:\/\/github.com\/coin-or\/Cbc"},{"key":"194_CR13","unstructured":"IBM ILOG CPLEX Optimizer (2019). http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"194_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/BF01609036","volume":"15","author":"HP Crowder","year":"1978","unstructured":"Crowder, H.P., Dembo, R.S., Mulvey, J.M.: Reporting computational experiments in mathematical programming. Math. Program. 15, 316\u2013329 (1978)","journal-title":"Math. Program."},{"key":"194_CR15","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"RM Fourer","year":"2002","unstructured":"Fourer, R.M., Gay, D.W., Kernighan, B.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press, California (2002)"},{"issue":"2","key":"194_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., et al.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2), 237\u2013265 (2019)","journal-title":"Math. Program. Comput."},{"key":"194_CR17","unstructured":"Galati, M., Ralphs, T., Wang, J.: Computational Experience with Generic Decomposition using the DIP Framework. In: Proceedings of RAMP 2012 (2012). http:\/\/coral.ie.lehigh.edu\/~ted\/files\/papers\/RAMP12.pdf"},{"key":"194_CR18","doi-asserted-by":"publisher","unstructured":"Galati, M., Ralphs, T., Wang, J.: DIP\/DipPy version 0.92 (2019). https:\/\/doi.org\/10.5281\/zenodo.2656800. http:\/\/github.com\/coin-or\/Dip","DOI":"10.5281\/zenodo.2656800"},{"key":"194_CR19","unstructured":"Galati, M.V.: Decomposition in Integer Programming. Phd, Lehigh University (2009). http:\/\/coral.ie.lehigh.edu\/~ted\/files\/papers\/MatthewGalatiDissertation09.pdf"},{"key":"194_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0083-5","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Math. Program. Comput. (2015). https:\/\/doi.org\/10.1007\/s12532-015-0083-5","journal-title":"Math. Program. Comput."},{"key":"194_CR21","doi-asserted-by":"publisher","unstructured":"Gamrath, G., L\u00fcbbecke, M.: Experiments with a generic Dantzig\u2013Wolfe decomposition for integer programs. In: P.\u00a0Festa (ed.) Experimental Algorithms, Lect. Notes in Comp. Sci., vol. 6049, pp. 239\u2013252. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_21","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"194_CR22","unstructured":"Georges, A., Gleixner, A., Gojic, G., Gottwald, R.L., Haley, D., Hendel, G., Matejczyk, B.: Feature-based algorithm selection for mixed integer programming. ZIB-Report 18-17, Zuse Institute Berlin (2018)"},{"key":"194_CR23","unstructured":"Gleixner, A., Bastubbe, M., Eifler, L., Gally, T., Gamrath, G., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., L\u00fcbbecke, M.E., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Schubert, C., Serrano, F., Shinano, Y., Viernickel, J.M., Walter, M., Wegscheider, F., Witt, J.T., Witzig, J.: The SCIP Optimization Suite 6.0. ZIB-Report 18\u201326. Zuse Institute, Berlin (2018)"},{"key":"194_CR24","unstructured":"Granlund, T., the GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, 6.1.2 edn (2016). http:\/\/gmplib.org\/"},{"key":"194_CR25","unstructured":"GUROBI Optimizer (2019). http:\/\/www.gurobi.com\/products\/gurobi-optimizer\/gurobi-overview"},{"issue":"1","key":"194_CR26","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A K-Means clustering algorithm. Appl. Stat. 28(1), 100\u2013108 (1979). https:\/\/doi.org\/10.2307\/2346830","journal-title":"Appl. Stat."},{"key":"194_CR27","unstructured":"Hendel, G.: IPET interactive performance evaluation tools. https:\/\/github.com\/GregorCH\/ipet"},{"issue":"1","key":"194_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/0101002","volume":"1","author":"A Hoffman","year":"1953","unstructured":"Hoffman, A., Mannos, M., Sokolowsky, D., Wiegmann, N.: Computational experience in solving linear programs. J. Soc. Ind. Appl. Math. 1(1), 17\u201333 (1953)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"194_CR29","first-page":"210","volume":"42","author":"J Hooker","year":"1993","unstructured":"Hooker, J.: Needed: an empirical science of algorithms. Oper. Res. 42(2), 210\u2013212 (1993)","journal-title":"Oper. Res."},{"key":"194_CR30","unstructured":"IBM Corporation, White Plains, N.Y.: Mathematical Programming System\/360 Version 2, Linear and Separable Programming\u2014User\u2019s Manual, 3 edn. (1969). Publication H20\u20130476\u20132"},{"key":"194_CR31","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01588801","volume":"49","author":"RHF Jackson","year":"1991","unstructured":"Jackson, R.H.F., Boggs, P.T., Nash, S.G., Powell, S.: Guidelines for reporting results of computational experiments. Report of the ad hoc committee. Math. Program. 49, 413\u2013425 (1991)","journal-title":"Math. Program."},{"key":"194_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3, 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"194_CR33","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/ijoc.1080.0293","volume":"21","author":"R Laundy","year":"2009","unstructured":"Laundy, R., Perregaard, M., Tavares, G., Tipi, H., Vazacopoulos, A.: Solving hard mixed integer programming problems with Xpress-MP: A MIPLIB 2003 case study. INFORMS J. Comput. 21, 304\u2013319 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"253\u2013303","key":"194_CR34","first-page":"144","volume":"3","author":"JT Linderoth","year":"2005","unstructured":"Linderoth, J.T., Ralphs, T.K.: Noncommercial software for mixed-integer linear programming. Integ. Program. Theory Pract. 3(253\u2013303), 144\u2013189 (2005)","journal-title":"Integ. Program. Theory Pract."},{"key":"194_CR35","first-page":"619","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A Lodi","year":"2009","unstructured":"Lodi, A.: MIP computation. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Berlin (2009)"},{"key":"194_CR36","unstructured":"MathWorks: MATLAB Optimization Toolbox (2019). https:\/\/de.mathworks.com\/products\/optimization.html"},{"issue":"1","key":"194_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"CC McGeoch","year":"1996","unstructured":"McGeoch, C.C.: Toward an experimental method for algorithm simulation. INFORMS J. Comput. 8(1), 1\u201315 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"194_CR38","first-page":"304","volume":"48","author":"CC McGeoch","year":"2001","unstructured":"McGeoch, C.C.: Experimental analysis of algorithms. Notices AMS 48(3), 304\u2013311 (2001)","journal-title":"Notices AMS"},{"key":"194_CR39","unstructured":"MIPLIB 2.0. http:\/\/miplib2010.zib.de\/miplib2\/miplib2.html"},{"key":"194_CR40","unstructured":"Mittelmann, H.: Benchmarks for optimization software. http:\/\/plato.asu.edu\/bench.html"},{"key":"194_CR41","unstructured":"MOSEK (2019). https:\/\/www.mosek.com\/"},{"key":"194_CR42","volume-title":"Computer Solutions of Linear Programs. Monographs on Numerical Analysis","author":"JL Nazareth","year":"1987","unstructured":"Nazareth, J.L.: Computer Solutions of Linear Programs. Monographs on Numerical Analysis. Oxford University Press, Oxford (1987)"},{"key":"194_CR43","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Advances in computers, vol.\u00a015, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"194_CR44","unstructured":"SAS: SAS\/OR (2019). https:\/\/www.sas.com\/en_us\/software\/or.html"},{"key":"194_CR45","unstructured":"Solving Constraint Integer Programs (2019). http:\/\/scip.zib.de\/"},{"key":"194_CR46","doi-asserted-by":"publisher","unstructured":"Shinano, Y.: The Ubiquity Generator framework: 7 years of progress in parallelizing branch-and-bound. In: N.\u00a0Kliewer, J.F. Ehmke, R.\u00a0Bornd\u00f6rfer (eds.) Operations Research Proceedings 2017, pp. 143\u2013149. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_20","DOI":"10.1007\/978-3-319-89920-6_20"},{"key":"194_CR47","doi-asserted-by":"publisher","unstructured":"Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T., Winkler, M.: Solving Open MIP Instances with ParaSCIP on Supercomputers using up to 80,000 Cores. In: Proceedings of the 30th IEEE International Parallel & Distributed Processing Symposium (2016). https:\/\/doi.org\/10.1109\/IPDPS.2016.56","DOI":"10.1109\/IPDPS.2016.56"},{"key":"194_CR48","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014)","journal-title":"Comput. Oper. Res."},{"key":"194_CR49","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles, K., Bowly, S.: Generating new test instances by evolving in instance space. Comput. Oper. Res. 63, 102\u2013113 (2015)","journal-title":"Comput. Oper. Res."},{"key":"194_CR50","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing high-dimensional data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"194_CR51","unstructured":"Xpress: FICO Xpress-Optimizer (2019). http:\/\/www.fico.com\/en\/Products\/DMTools\/xpress-overview\/Pages\/Xpress-Optimizer.aspx"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00194-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-020-00194-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00194-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T17:04:17Z","timestamp":1629219857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-020-00194-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00194-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"25 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}