{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T10:29:32Z","timestamp":1717237772219},"reference-count":24,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T00:00:00Z","timestamp":1430956800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2016,11]]},"abstract":"Abstract<\/jats:title>We propose algorithmic frameworks based on the iterated local search (ILS) metaheuristic to obtain good\u2010quality solutions for the Euclidean Steiner tree problem (ESTP) in n<\/jats:italic> dimensions. This problem consists in finding a tree with minimal total length that spans p<\/jats:italic> points given in an n<\/jats:italic>\u2010dimensional Euclidean space and, eventually, also some additional points whose insertion contributes to reduce the total length of the tree. These ILS approaches make use of both the tree enumeration structure, called topology\u2010describing vector, and the exact minimization step of a well\u2010known branch\u2010and\u2010bound method for the ESTP. Computational results are provided.<\/jats:p>","DOI":"10.1111\/itor.12168","type":"journal-article","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T20:43:15Z","timestamp":1431031395000},"page":"1185-1199","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Iterated local search algorithms for the Euclidean Steiner tree problem in n<\/i> dimensions"],"prefix":"10.1111","volume":"23","author":[{"given":"Vin\u00edcius Leal","family":"do Forte","sequence":"first","affiliation":[{"name":"PESC\/COPPE Universidade Federal do Rio de Janeiro, Rio de Janeiro RJ PO Box 68511 Brazil"}]},{"given":"Fl\u00e1vio Marcelo Tavares","family":"Montenegro","sequence":"additional","affiliation":[{"name":"ENCE\/IBGE Escola Nacional de Ci\u00eancias Estat\u00edsticas, Rio de Janeiro RJ Brazil"}]},{"given":"Jos\u00e9 Andr\u00e9 de Moura","family":"Brito","sequence":"additional","affiliation":[{"name":"ENCE\/IBGE Escola Nacional de Ci\u00eancias Estat\u00edsticas, Rio de Janeiro RJ Brazil"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[{"name":"PESC\/COPPE Universidade Federal do Rio de Janeiro, Rio de Janeiro RJ PO Box 68511 Brazil"}]}],"member":"311","published-online":{"date-parts":[[2015,5,7]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494275069"},{"key":"e_1_2_9_3_1","volume-title":"Steiner Minimal Trees, v. 23, Nonconvex Optimization and Its Application","author":"Cieslik D.","year":"1998"},{"key":"e_1_2_9_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.08.006"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NUMA.0000021765.17831.bc"},{"key":"e_1_2_9_6_1","unstructured":"Forte V.L. 2010.Algoritmos de Otimiza\u00e7\u00e3o Aplicados ao Problema de Steiner em N Dimens\u00f5es.MSc thesis COPPE Universidade Federal do Rio de Janeiro Brazil."},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_9_9_1","volume-title":"The Steiner Tree Problem. Annals of Discrete Mathematics 53","author":"Hwang F.K.","year":"1992"},{"issue":"8","key":"e_1_2_9_10_1","first-page":"223","article-title":"O minim\u00e1ln\u00edch grafech, obsahuj\u00edc\u00edch n dan\u00fdch bod\u016f","volume":"63","author":"Jarn\u00edk V.","year":"1934","journal-title":"Casopis pro p\u011bstov\u00e1n\u00ed matematiky a fysiky"},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240303"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/72.1.191"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260411"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018903619285"},{"key":"e_1_2_9_16_1","first-page":"299","article-title":"Large\u2010step Markov chains for the traveling salesman problem","volume":"5","author":"Martin O.","year":"1991","journal-title":"Complex Systems"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/2306136"},{"key":"e_1_2_9_18_1","first-page":"509","volume-title":"Essays and Surveys in Metaheuristics","author":"Montenegro F.","year":"2001"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.056702"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240802"},{"key":"e_1_2_9_22_1","unstructured":"Rocha M.L. 2008.Aplica\u00e7\u00f5es de Algoritmos Paralelos e H\u00edbridos para o Problema de \u00c1rvore de Steiner Euclidiana no.PhD thesis COPPE\u2014Universidade Federal do Rio de Janeiro Brazil."},{"key":"e_1_2_9_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758756"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1973.tb00595.x"},{"key":"e_1_2_9_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495288362"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/itor.12168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T15:23:59Z","timestamp":1696173839000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/itor.12168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,7]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.1111\/itor.12168"],"URL":"https:\/\/doi.org\/10.1111\/itor.12168","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"value":"0969-6016","type":"print"},{"value":"1475-3995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,7]]},"assertion":[{"value":"2012-11-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-07","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
