{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:37:12Z","timestamp":1762324632030,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10898-019-00871-1","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T06:02:41Z","timestamp":1578895361000},"page":"241-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved metaheuristics for the quartet method of hierarchical clustering"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7357-5858","authenticated-orcid":false,"given":"Sergio","family":"Consoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Korst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Pauws","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gijs","family":"Geleijnse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"871_CR1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E Aarts","year":"1988","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Chichester (1988)"},{"key":"871_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"E Aarts","year":"2005","unstructured":"Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 187\u2013210. Springer, Berlin (2005)"},{"issue":"3","key":"871_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1089\/cmb.1998.5.377","volume":"5","author":"A Ben-Dor","year":"1998","unstructured":"Ben-Dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. J. Comput. Biol. 5(3), 377\u2013390 (1998)","journal-title":"J. Comput. Biol."},{"key":"871_CR4","doi-asserted-by":"crossref","unstructured":"Berry, V., Jiang, T., Kearney, P., Li, M., Wareham, T.: Quartet cleaning: improved algorithms and simulations. In: Voigt, H.M., Ebeling, W., Rechenberg, I., Schwefel, H.P. (eds.) Algorithms\u2014Proceedings 7th European Symposium on Algorithms (ESA\u201999), Lecture Notes in Computer Science, vol. 1643, pp. 313\u2013324. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48481-7_28"},{"key":"871_CR5","unstructured":"Cilibrasi, R.: The Complearn toolkit (2007). http:\/\/www.complearn.org\/"},{"issue":"4","key":"871_CR6","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"871_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: The google similarity distance. IEEE Trans. Knowl. Data Eng. 19(3), 370\u2013383 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"871_CR8","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.patcog.2010.08.033","volume":"44","author":"R Cilibrasi","year":"2011","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B.: A fast quartet tree heuristic for hierarchical clustering. Pattern Recognit. 44(3), 662\u2013677 (2011)","journal-title":"Pattern Recognit."},{"issue":"4","key":"871_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1162\/0148926042728449","volume":"28","author":"R Cilibrasi","year":"2004","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.M.B., de Wolf, R.: Algorithmic clustering of music based on string compression. Comput. Music J. 28(4), 49\u201367 (2004)","journal-title":"Comput. Music J."},{"issue":"10","key":"871_CR10","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1109\/TKDE.2009.188","volume":"22","author":"S Consoli","year":"2010","unstructured":"Consoli, S., Darby-Dowman, K., Geleijnse, G., Korst, J., Pauws, S.: Heuristic approaches for the quartet method of hierarchical clustering. IEEE Trans. Knowl. Data Eng. 22(10), 1428\u20131443 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"871_CR11","doi-asserted-by":"publisher","unstructured":"Consoli, S., Korst, J., Pauws, S., Geleijnse, G.: An exact algorithm for the minimum quartet tree cost problem. 4OR Q. J. Oper. Res. 17(4), 401\u2013425 (2019). https:\/\/doi.org\/10.1007\/s10288-018-0394-2","DOI":"10.1007\/s10288-018-0394-2"},{"key":"871_CR12","doi-asserted-by":"crossref","unstructured":"Consoli, S., Korst, J., Pauws, S., Geleijnse, G.: Improved variable neighbourhood search heuristic for quartet clustering. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) Proceedings 6th International Conference on Variable Neighborhood Search (ICVNS 2018), Lecture Notes in Computer Science, vol. 11328, pp. 1\u201312. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-15843-9_1"},{"issue":"3","key":"871_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1111\/itor.12240","volume":"24","author":"S Consoli","year":"2017","unstructured":"Consoli, S., Stilianakis, N.I.: A quartet method based on variable neighborhood search for biomedical literature extraction and clustering. Int. Trans. Oper. Res. 24(3), 537\u2013558 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"871_CR14","first-page":"113","volume":"10","author":"T Davidovi\u0107","year":"2000","unstructured":"Davidovi\u0107, T.: Scheduling heuristic for dense task graphs. Yugosl. J. Oper. Res. 10, 113\u2013136 (2000)","journal-title":"Yugosl. J. Oper. Res."},{"key":"871_CR15","first-page":"1","volume":"7","author":"J Dem\u015bar","year":"2006","unstructured":"Dem\u015bar, J.: Statistical comparison of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"871_CR16","volume-title":"Graph Theory","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2000)"},{"issue":"6","key":"871_CR17","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J Felsenstein","year":"1981","unstructured":"Felsenstein, J.: Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evolut. 17(6), 368\u2013376 (1981)","journal-title":"J. Mol. Evolut."},{"key":"871_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman, M.: A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 11, 86\u201392 (1940)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"871_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01890123","volume":"1","author":"GW Furnas","year":"1984","unstructured":"Furnas, G.W.: The generation of random, binary unordered trees. J. Classif. 1(1), 187\u2013233 (1984)","journal-title":"J. Classif."},{"key":"871_CR20","unstructured":"Geleijnse, G., Korst, J., de\u00a0Boer, V.: Instance classification using co-occurrences on the web. In: Proceedings of the ISWC 2006 Workshop on Web Content Mining (WebConMine). Athens, GA (2006). http:\/\/www.dse.nl\/~gijsg\/webconmine.pdf"},{"key":"871_CR21","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"871_CR22","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TKDE.2010.173","volume":"23","author":"A Granados","year":"2011","unstructured":"Granados, A., Cebrian, M., Camacho, D., Rodriguez, F.B.: Reducing the loss of information through annealing text distortion. IEEE Trans. Knowl. Data Eng. 23(7), 1090\u20131102 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"871_CR23","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-319-07124-4_19","volume-title":"Handbook of Heuristics, Chap.\u00a015","author":"P Hansen","year":"2018","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Marti, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, Chap.\u00a015, pp. 759\u2013787. Springer Nature, Berlin (2018)"},{"key":"871_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., Perez-Brito, D.: Variable neighborhood decomposition search. J. Heurist. 7, 335\u2013350 (2001)","journal-title":"J. Heurist."},{"issue":"6","key":"871_CR25","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T Jiang","year":"2000","unstructured":"Jiang, T., Kearney, P., Li, M.: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30(6), 1942\u20131961 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4598","key":"871_CR26","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"871_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"issue":"2","key":"871_CR28","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(02)00833-0","volume":"151","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., Petrovi\u0107, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2), 389\u2013399 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"871_CR29","unstructured":"Nemenyi, P.B.: Distribution-free multiple comparisons. Ph.D. thesis, Princeton University, NJ (1963)"},{"key":"871_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1287\/ijoc.2018.0876","volume":"31","author":"J Pei","year":"2019","unstructured":"Pei, J., Darzi\u0107, Z., Drazi\u0107, M., Mladenovi\u0107, N., Pardalos, P.: Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations. INFORMS J. Comput. 31, 235\u2013250 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"6960","key":"871_CR31","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1038\/nature02053","volume":"425","author":"A Rokas","year":"2003","unstructured":"Rokas, A., Williams, B.L., King, N., Carroll, S.B.: Genome-scale approaches to resolving incongruence in molecular phylogenies. Nature 425(6960), 798\u2013804 (2003)","journal-title":"Nature"},{"key":"871_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"MA Steel","year":"1992","unstructured":"Steel, M.A.: The complexity of reconstructiong trees from qualitative characters and subtrees. J. Classif. 9, 91\u2013116 (1992)","journal-title":"J. Classif."},{"issue":"7","key":"871_CR33","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K Strimmer","year":"1996","unstructured":"Strimmer, K., von Haeseler, A.: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evolut. 13(7), 964\u2013969 (1996)","journal-title":"Mol. Biol. Evolut."},{"issue":"3","key":"871_CR34","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.compbiolchem.2005.04.001","volume":"29","author":"J Weyer-Menkhoff","year":"2005","unstructured":"Weyer-Menkhoff, J., Devauchelle, C., Grossmann, A., Gr\u00fcnewald, S.: Integer linear programming as a tool for constructing trees from quartet data. Comput. Biol. Chem. 29(3), 196\u2013203 (2005)","journal-title":"Comput. Biol. Chem."},{"key":"871_CR35","first-page":"95","volume":"21","author":"R Whittaker","year":"1983","unstructured":"Whittaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21, 95\u2013108 (1983)","journal-title":"INFOR"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00871-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00871-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00871-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,12]],"date-time":"2021-01-12T21:23:44Z","timestamp":1610486624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00871-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00871-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2020,1,13]]},"assertion":[{"value":"27 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}