{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:33Z","timestamp":1740149133392,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Fund\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/76268\/2011","CIDMA - UIDB\/04106\/2020 and UIDP\/04106\/2020"],"award-info":[{"award-number":["SFRH\/BD\/76268\/2011","CIDMA - UIDB\/04106\/2020 and UIDP\/04106\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-020-00608-z","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:02:37Z","timestamp":1602028957000},"page":"2305-2342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MIP model-based heuristics for the minimum weighted tree reconstruction problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Olga","family":"Fajarda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0529-5090","authenticated-orcid":false,"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"issue":"1","key":"608_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg T, Berthold T (2007) Improving the feasibility pump. Discrete Optim 4(1):77\u201386","journal-title":"Discrete Optim"},{"issue":"1","key":"608_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco L, Fischetti M, Lodi A (2007) A feasibility pump heuristic for general mixed-integer problems. Discrete Optim 4(1):63\u201376","journal-title":"Discrete Optim"},{"issue":"2","key":"608_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1002\/rsa.20305","volume":"37","author":"S Bhamidi","year":"2010","unstructured":"Bhamidi S, Rajagopal R, Roch S (2010) Network delay inference from additive metrics. Random Struct Algorithms 37(2):176\u2013203","journal-title":"Random Struct Algorithms"},{"issue":"3","key":"608_CR4","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/110823596","volume":"22","author":"NL Boland","year":"2012","unstructured":"Boland NL, Eberhard AC, Engineer F, Tsoukalas A (2012) A new approach to the feasibility pump in mixed integer programming. SIAM J Optim 22(3):831\u2013861","journal-title":"SIAM J Optim"},{"key":"608_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/11751588_126","volume-title":"Computational science and its applications\u2014ICCSA 2006","author":"S-S Byun","year":"2006","unstructured":"Byun S-S, Yoo C (2006) Reducing delivery delay in HRM tree. In: Gavrilova M, Gervasi O, Kumar V, Tan C, Taniar D, Lagan\u00e0 A, Mun Y, Choo H (eds) Computational science and its applications\u2014ICCSA 2006, vol 3981. Lecture notes in computer science. Springer, Berlin, pp 1189\u20131198"},{"issue":"2","key":"608_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/net.20280","volume":"53","author":"D Catanzaro","year":"2009","unstructured":"Catanzaro D (2009) The minimum evolution problem: overview and classification. Networks 53(2):112\u2013125","journal-title":"Networks"},{"issue":"3","key":"608_CR7","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ejor.2015.02.019","volume":"244","author":"D Catanzaro","year":"2015","unstructured":"Catanzaro D, Aringhieri R, Summa MD, Pesenti R (2015) A branch-price-and-cut algorithm for the minimum evolution problem. Eur J Oper Res 244(3):753\u2013765","journal-title":"Eur J Oper Res"},{"issue":"2","key":"608_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1002\/net.20281","volume":"53","author":"D Catanzaro","year":"2009","unstructured":"Catanzaro D, Labb\u00e9 M, Pesenti R, Salazar-Gonzal\u00e9z J-J (2009) Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. Networks 53(2):126\u2013140","journal-title":"Networks"},{"issue":"2","key":"608_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/ijoc.1110.0455","volume":"24","author":"D Catanzaro","year":"2012","unstructured":"Catanzaro D, Labb\u00e9 M, Pesenti R, Salazar-Gonzal\u00e9z J-J (2012) The balanced minimum evolution problem. Inf J Comput 24(2):276\u2013294","journal-title":"Inf J Comput"},{"issue":"3","key":"608_CR10","first-page":"550","volume":"21","author":"LL Cavalli-Sforza","year":"1967","unstructured":"Cavalli-Sforza LL, Edwards AW (1967) Phylogenetic analysis. Models Estim Proc Evolut 21(3):550\u2013570","journal-title":"Models Estim Proc Evolut"},{"issue":"3","key":"608_CR11","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1006\/jcss.2001.1785","volume":"63","author":"F Chung","year":"2001","unstructured":"Chung F, Garrett M, Graham R, Shallcross D (2001) Distance realization problems with applications to internet tomography. J Comput Syst Sci 63(3):432\u2013448","journal-title":"J Comput Syst Sci"},{"key":"608_CR12","doi-asserted-by":"crossref","unstructured":"Coates M, Rabbat M, Nowak R (2003) Merging logical topologies using end-to-end measurements. In: Proceedings of the 3rd ACM SIGCOMM conference on internet measurement, IMC \u201903, pp 192\u2013203","DOI":"10.1145\/948205.948230"},{"issue":"3","key":"608_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF02294065","volume":"51","author":"JE Corter","year":"1986","unstructured":"Corter JE, Tversky A (1986) Extended similarity trees. Psychometrika 51(3):429\u2013451","journal-title":"Psychometrika"},{"issue":"6","key":"608_CR14","doi-asserted-by":"publisher","first-page":"593","DOI":"10.3758\/BF03213779","volume":"8","author":"JP Cunningham","year":"1980","unstructured":"Cunningham JP (1980) Trees as memory representations for simple visual patterns. Memory Cogn 8(6):593\u2013605","journal-title":"Memory Cogn"},{"issue":"4","key":"608_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0092-8240(87)80007-1","volume":"49","author":"WH Day","year":"1987","unstructured":"Day WH (1987) Computational complexity of inferring phylogenies from dissimilarity matrices. Bull Math Biol 49(4):461\u2013467","journal-title":"Bull Math Biol"},{"issue":"4","key":"608_CR16","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/BF02293884","volume":"48","author":"G De Soete","year":"1983","unstructured":"De Soete G (1983) A least squares algorithm for fitting additive trees to proximity data. Psychometrika 48(4):621\u2013626","journal-title":"Psychometrika"},{"issue":"3","key":"608_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1093\/molbev\/msh049","volume":"21","author":"R Desper","year":"2004","unstructured":"Desper R, Gascuel O (2004) Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting. Mol Biol Evolut 21(3):587\u2013598","journal-title":"Mol Biol Evolut"},{"issue":"2","key":"608_CR18","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1109\/TIFS.2011.2169959","volume":"7","author":"Z Dias","year":"2012","unstructured":"Dias Z, Rocha A, Goldenstein S (2012) Image phylogeny by minimal spanning trees. IEEE Trans Inf Foren Secur 7(2):774\u2013788","journal-title":"IEEE Trans Inf Foren Secur"},{"issue":"4","key":"608_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/COMST.2007.4444750","volume":"9","author":"B Donnet","year":"2007","unstructured":"Donnet B, Friedman T (2007) Internet topology discovery: a survey. IEEE Commun Surv 9(4):2\u201314","journal-title":"IEEE Commun Surv"},{"issue":"1","key":"608_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M Farach","year":"1995","unstructured":"Farach M, Kannan S, Warnow T (1995) A robust model for finding optimal evolutionary trees. Algorithmica 13(1):155\u2013179","journal-title":"Algorithmica"},{"key":"608_CR21","unstructured":"Felsenstein J (2004) Distance matrix methods. In Inferring Phylogenies, chapter\u00a011, pp 147\u2013175. Sinauer Associates, Inc., Sunderland, Massachusetts"},{"issue":"1","key":"608_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.orl.2011.10.003","volume":"40","author":"S Fiorini","year":"2012","unstructured":"Fiorini S, Joret G (2012) Approximating the balanced minimum evolution problem. Oper Res Lett 40(1):31\u201335","journal-title":"Oper Res Lett"},{"issue":"1","key":"608_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti M, Glover F, Lodi A (2005) The feasibility pump. Math Programm 104(1):91\u2013104","journal-title":"Math Programm"},{"issue":"1\u20133","key":"608_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Programm 98(1\u20133):23\u201347","journal-title":"Math Programm"},{"issue":"1","key":"608_CR25","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.ejor.2016.06.014","volume":"256","author":"B Fortz","year":"2017","unstructured":"Fortz B, Oliveira O, Requejo C (2017) Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. Eur J Oper Res 256(1):242\u2013251","journal-title":"Eur J Oper Res"},{"issue":"5","key":"608_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.3758\/BF03199852","volume":"25","author":"G Gilmore","year":"1979","unstructured":"Gilmore G, Hersh H, Caramazza A, Griffin J (1979) Multidimensional letter similarity derived from recognition errors. Percep Psychophys 25(5):425\u2013431","journal-title":"Percep Psychophys"},{"issue":"2","key":"608_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/COMST.2008.4564479","volume":"10","author":"H Haddadi","year":"2008","unstructured":"Haddadi H, Rio M, Iannaccone G, Moore A, Mortier R (2008) Network topologies: inference, modelling and generation. IEEE Commun Surv 10(2):48\u201369","journal-title":"IEEE Commun Surv"},{"key":"608_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"D Huson","year":"2011","unstructured":"Huson D, Scornavacca C (2011) A survey of combinatorial methods for phylogenetic networks. Genome Biol Evol 3:23\u201335","journal-title":"Genome Biol Evol"},{"issue":"4","key":"608_CR29","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1093\/oxfordjournals.molbev.a025618","volume":"13","author":"S Kumar","year":"1996","unstructured":"Kumar S (1996) A stepwise algorithm for finding minimum evolution trees. Mol Biol Evol 13(4):584\u2013593","journal-title":"Mol Biol Evol"},{"key":"608_CR30","doi-asserted-by":"crossref","unstructured":"Ni J, Xie H, Tatikonda S, Yang Y.R (2008) Network routing topology inference from end-to-end measurements. In: Proceedings of the IEEE INFOCOM 2008, the 27th Annual Joint Conference of the IEEE Computer and Communications Societies, pp 36\u201340","DOI":"10.1109\/INFOCOM.2008.16"},{"issue":"5","key":"608_CR31","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1137\/S0097539796311077","volume":"28","author":"D Parker","year":"1996","unstructured":"Parker D, Ram P (1996) The construction of Huffman codes is a submodular (\u201cconvex\u201d) optimization problem over a lattice of binary trees. SIAM J Comput 28(5):1875\u20131905","journal-title":"SIAM J Comput"},{"key":"608_CR32","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s002390010065","volume":"51","author":"Y Pauplin","year":"2000","unstructured":"Pauplin Y (2000) Direct calculation of a tree length using a distance matrix. J Mol Evol 51:41\u201347","journal-title":"J Mol Evol"},{"issue":"4","key":"608_CR33","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 4(4):406\u2013425","journal-title":"Mol Biol Evol"},{"issue":"3","key":"608_CR34","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF02293654","volume":"42","author":"S Sattath","year":"1977","unstructured":"Sattath S, Tversky A (1977) Additive similarity trees. Psychometrika 42(3):319\u2013345","journal-title":"Psychometrika"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00608-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00608-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00608-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T17:38:49Z","timestamp":1659029929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00608-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["608"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00608-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"16 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}