{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:23:09Z","timestamp":1774797789579,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s12532-018-0144-7","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T06:15:43Z","timestamp":1535350543000},"page":"597-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":118,"title":["RBFOpt: an open-source library for black-box optimization with costly function evaluations"],"prefix":"10.1007","volume":"10","author":[{"given":"Alberto","family":"Costa","sequence":"first","affiliation":[]},{"given":"Giacomo","family":"Nannicini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"issue":"1","key":"144_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"144_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2004","unstructured":"Audet, C., Dennis Jr., J.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"144_CR3","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10898-017-0574-1","volume":"70","author":"C Audet","year":"2018","unstructured":"Audet, C., Kokkolaras, M., Le Digabel, S., Talgorn, B.: Order-based error for managing ensembles of surrogates in mesh adaptive direct search. J. Glob. Optim. 70(3), 645\u2013675 (2018)","journal-title":"J. Glob. Optim."},{"key":"144_CR4","unstructured":"Baudoui, V.: Optimisation robuste multiobjectifs par mod\u00e8les de substitution. Ph.D. thesis, University of Toulouse Paul Sabatier (2012)"},{"issue":"4","key":"144_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1011584207202","volume":"1","author":"M Bj\u00f6rkman","year":"2000","unstructured":"Bj\u00f6rkman, M., Holmstr\u00f6m, K.: Global optimization of costly nonconvex functions using radial basis functions. Optim. Eng. 1(4), 373\u2013397 (2000)","journal-title":"Optim. Eng."},{"key":"144_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L., Conn, A., Cornu\u00e9jols, G., Grossmann, I., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"issue":"1","key":"144_CR7","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":"144_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: Di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, New York (2006)"},{"issue":"1\u20133","key":"144_CR9","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02614326","volume":"79","author":"AR Conn","year":"1997","unstructured":"Conn, A.R., Scheinberg, K., Toint, P.L.: Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79(1\u20133), 397\u2013414 (1997). https:\/\/doi.org\/10.1007\/BF02614326","journal-title":"Math. Program."},{"key":"144_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"144_CR11","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TKDE.2017.2761749","volume":"30","author":"A Costa","year":"2017","unstructured":"Costa, A., Di Buccio, E., Melucci, M., Nannicini, G.: Efficient parameter estimation for information retrieval using black-box optimization. IEEE Trans. Knowl. Data Eng. 30, 1240\u20131253 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"144_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-319-12544-2_3","volume-title":"Complex Systems Design & Management Asia","author":"Alberto Costa","year":"2015","unstructured":"Costa, A., Nannicini, G., Schroepfer, T., Wortmann, T.: Black-box optimization of lighting simulation in architectural design. In: Cardin, M.A., Krob, D., Chuen, L., Tan, Y., Wood, K. (eds.) Designing Smart Cities: Proceedings of the First Asia-Pacific Conference on Complex Systems Design & Management, CSD&M Asia 2014, pp. 27\u201339. Springer (2015)"},{"issue":"1","key":"144_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.orl.2016.11.004","volume":"45","author":"C D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio, C., Nannicini, G., Sartor, G.: MILP models for the selection of a small set of well-distributed points. Oper. Res. Lett. 45(1), 46\u201352 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"4\/5","key":"144_CR14","doi-asserted-by":"publisher","first-page":"9-1","DOI":"10.1147\/JRD.2017.2709578","volume":"61","author":"GI Diaz","year":"2017","unstructured":"Diaz, G.I., Fokour, A., Nannicini, G., Samulowitz, H.: An effective algorithm for hyperparameter optimization of neural networks. IBM J. Res. Dev. 61(4\/5), 9-1 (2017)","journal-title":"IBM J. Res. Dev."},{"key":"144_CR15","first-page":"1","volume-title":"Towards Global Optimization","author":"L Dixon","year":"1975","unstructured":"Dixon, L., Szego, G.: The global optimization problem: an introduction. In: Dixon, L., Szego, G. (eds.) Towards Global Optimization, pp. 1\u201315. North Holland, Amsterdam (1975)"},{"key":"144_CR16","unstructured":"Eriksson, D., Bindel, D., Shoemaker, C.: Surrogate optimization toolbox (pySOT) (2015). http:\/\/github.com\/dme65\/pySOT"},{"issue":"9","key":"144_CR17","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.advengsoft.2011.05.004","volume":"42","author":"F Fuerle","year":"2011","unstructured":"Fuerle, F., Sienz, J.: Formulation of the Audze\u2013Eglais uniform latin hypercube design of experiments for constrained design spaces. Adv. Eng. Softw. 42(9), 680\u2013689 (2011)","journal-title":"Adv. Eng. Softw."},{"issue":"1","key":"144_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1017930332101","volume":"21","author":"J Gablonsky","year":"2001","unstructured":"Gablonsky, J., Kelley, C.: A locally-biased form of the DIRECT algorithm. J. Glob. Optim. 21(1), 27\u201337 (2001)","journal-title":"J. Glob. Optim."},{"key":"144_CR19","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics, 2nd edn. Kluwer, Dordrecht (2010)","edition":"2"},{"key":"144_CR20","volume-title":"Handbook of Metaheuristics","year":"2003","unstructured":"Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics. Kluwer, Dordrecht (2003)"},{"issue":"1\u20132","key":"144_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"CP Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1\u20132), 67\u2013100 (2000). https:\/\/doi.org\/10.1023\/A:1006314320276","journal-title":"J. Autom. Reason."},{"key":"144_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"HM Gutmann","year":"2001","unstructured":"Gutmann, H.M.: A radial basis function method for global optimization. J. Glob. Optim. 19, 201\u2013227 (2001). https:\/\/doi.org\/10.1023\/A:1011255519438","journal-title":"J. Glob. Optim."},{"key":"144_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3226-5","volume-title":"Pyomo\u2014optimization Modeling in Python. Springer Optimization and Its Applications","author":"WE Hart","year":"2012","unstructured":"Hart, W.E., Laird, C., Watson, J.P., Woodruff, D.L.: Pyomo\u2014optimization Modeling in Python. Springer Optimization and Its Applications, vol. 67. Springer, Berlin (2012)"},{"issue":"3","key":"144_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3(3), 219\u2013260 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0026-8","journal-title":"Math. Program. Comput."},{"key":"144_CR25","unstructured":"Hemker, T.: Derivative free surrogate optimization for mixed-integer nonlinear black-box problems in engineering. Master\u2019s thesis, Technischen Universit\u00e4t Darmstadt (2008)"},{"issue":"3","key":"144_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-007-9256-8","volume":"41","author":"K Holmstr\u00f6m","year":"2008","unstructured":"Holmstr\u00f6m, K.: An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization. J. Glob. Optim. 41(3), 447\u2013464 (2008)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"144_CR27","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11081-008-9037-3","volume":"9","author":"K Holmstr\u00f6m","year":"2008","unstructured":"Holmstr\u00f6m, K., Quttineh, N.H., Edvall, M.M.: An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization. Optim. Eng. 9(4), 311\u2013339 (2008)","journal-title":"Optim. Eng."},{"issue":"2","key":"144_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1377612.1377613","volume":"35","author":"W Huyer","year":"2008","unstructured":"Huyer, W., Neumaier, A.: SNOBFIT\u2014stable noisy optimization by branch and fit. ACM Trans. Math. Softw. 35(2), 1\u201325 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"144_CR29","doi-asserted-by":"crossref","unstructured":"Ilievski, I., Akhtar, T., Feng, J., Shoemaker, C.A.: Efficient hyperparameter optimization of deep learning algorithms using deterministic RBF surrogates. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)","DOI":"10.1609\/aaai.v31i1.10647"},{"issue":"4","key":"144_CR30","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s11081-009-9087-1","volume":"11","author":"S Jakobsson","year":"2010","unstructured":"Jakobsson, S., Patriksson, M., Rudholm, J., Wojciechowski, A.: A method for simulation based optimization using radial basis functions. Optim. Eng. 11(4), 501\u2013532 (2010)","journal-title":"Optim. Eng."},{"key":"144_CR31","unstructured":"Johnson, S.G.: The NLopt nonlinear-optimization package. http:\/\/ab-initio.mit.edu\/nlopt"},{"issue":"1","key":"144_CR32","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"D Jones","year":"1993","unstructured":"Jones, D., Perttunen, C., Stuckman, B.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"144_CR33","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"D Jones","year":"1998","unstructured":"Jones, D., Schonlau, M., Welch, W.: Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"144_CR34","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.J.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"issue":"4","key":"144_CR35","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Digabel Le","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011). https:\/\/doi.org\/10.1145\/1916461.1916468","journal-title":"ACM Trans. Math. Softw."},{"key":"144_CR36","unstructured":"MINLP Library 2. http:\/\/www.gamsworld.org\/minlp\/minlplib2\/html\/"},{"issue":"1","key":"144_CR37","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"144_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11081-015-9281-2","volume":"17","author":"Juliane M\u00fcller","year":"2015","unstructured":"M\u00fcller, J.: MISO: mixed-integer surrogate optimization framework. Optim. Eng. 1\u201327 (2015). https:\/\/doi.org\/10.1007\/s11081-015-9281-2","journal-title":"Optimization and Engineering"},{"issue":"10","key":"144_CR39","doi-asserted-by":"publisher","first-page":"3285","DOI":"10.5194\/gmd-8-3285-2015","volume":"8","author":"J M\u00fcller","year":"2015","unstructured":"M\u00fcller, J., Paudel, R., Shoemaker, C.A., Woodbury, J., Wang, Y., Mahowald, N.: $$\\text{ CH }_{4}$$ CH 4 parameter estimation in CLM4.5bgc using surrogate global optimization. Geosci. Model Dev. 8(10), 3285\u20133310 (2015). https:\/\/doi.org\/10.5194\/gmd-8-3285-2015","journal-title":"Geosci. Model Dev."},{"issue":"2","key":"144_CR40","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10898-014-0184-0","volume":"60","author":"J M\u00fcller","year":"2014","unstructured":"M\u00fcller, J., Shoemaker, C.A.: Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms forcomputationally expensive black-box global optimization problems. J. Glob. Optim. 60(2), 123\u2013144 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0184-0","journal-title":"J. Glob. Optim."},{"issue":"5","key":"144_CR41","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1016\/j.cor.2012.08.022","volume":"40","author":"J M\u00fcller","year":"2013","unstructured":"M\u00fcller, J., Shoemaker, C.A., Pich\u00e9, R.: SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems. Comput. Oper. Res. 40(5), 1383\u20131400 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.08.022","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"144_CR42","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"144_CR43","unstructured":"Neumaier, A.: Neumaier\u2019s collection of test problems for global optimization. http:\/\/www.mat.univie.ac.at\/~neum\/glopt\/my_problems.html . Retrieved in May 2014"},{"key":"144_CR44","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-0348-8696-3_14","volume-title":"New Developments in Approximation Theory","author":"M. J. D. Powell","year":"1999","unstructured":"Powell, M.: Recent research at Cambridge on radial basis functions. In: M\u00fcller, M.W., Buhmann, M.D., Mache, D.H., Felten, M. (eds.) New Developments in Approximation Theory. International Series of Numerical Mathematics, vol. 132, pp. 215\u2013232. Birkhauser Verlag, Basel (1999)"},{"key":"144_CR45","unstructured":"Powell, M.J.: The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report, Cambridge NA Report NA2009\/06, University of Cambridge (2009)"},{"key":"144_CR46","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10898-006-9040-1","volume":"37","author":"R Regis","year":"2007","unstructured":"Regis, R., Shoemaker, C.: Improved strategies for radial basis function methods for global optimization. J. Glob. Optim. 37, 113\u2013135 (2007). https:\/\/doi.org\/10.1007\/s10898-006-9040-1","journal-title":"J. Glob. Optim."},{"issue":"4","key":"144_CR47","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/ijoc.1060.0182","volume":"19","author":"RG Regis","year":"2007","unstructured":"Regis, R.G., Shoemaker, C.A.: A stochastic radial basis function method for the global optimization of expensive functions. INFORMS J. Comput. 19(4), 497\u2013509 (2007). https:\/\/doi.org\/10.1287\/ijoc.1060.0182","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"144_CR48","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1007\/s10898-012-9940-1","volume":"56","author":"RG Regis","year":"2013","unstructured":"Regis, R.G., Shoemaker, C.A.: A quasi-multistart framework for global optimization of expensive functions using response surface models. J. Glob. Optim. 56(4), 1719\u20131753 (2013)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"144_CR49","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"144_CR50","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01096734","volume":"3","author":"F Schoen","year":"1993","unstructured":"Schoen, F.: A wide class of test functions for global optimization. J. Glob. Optim. 3(2), 133\u2013137 (1993)","journal-title":"J. Glob. Optim."},{"key":"144_CR51","volume-title":"Global Optimization","author":"A T\u00f6rn","year":"1987","unstructured":"T\u00f6rn, A., \u017dilinskas, A.: Global Optimization. Springer, Berlin (1987)"},{"issue":"1","key":"144_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"144_CR53","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1017\/S0890060415000451","volume":"29","author":"T Wortmann","year":"2015","unstructured":"Wortmann, T., Costa, A., Nannicini, G., Schroepfer, T.: Advantages of surrogate models for architectural design optimization. Artif. Intell. Eng. Des. Anal. Manuf. 29(4), 471\u2013481 (2015)","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"144_CR54","unstructured":"Wortmann, T., Waibel, C., Nannicini, G., Evins, R., Schroepfer, T., Carmeliet, J.: Are genetic algorithms really the best choice for building energy optimization? In: Proceedings of the Symposium on Simulation for Architecture & Urban Design (SimAUD), pp. 51\u201358. SCS, Toronto, Canada (2017)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0144-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0144-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0144-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T16:31:05Z","timestamp":1720542665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0144-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["144"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0144-7","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"5 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}