{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:38:11Z","timestamp":1730313491819,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144185","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1187-1194","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO"],"prefix":"10.1145","author":[{"given":"Martin","family":"Gruber","sequence":"first","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]},{"given":"Jano","family":"van Hemert","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Congressus Numerantium, 144: 161--182","author":"Abdalla A.","year":"2000","unstructured":"A. Abdalla , N. Deo , and P. Gupta . Random-tree diameter and the diameter constrained MST . Congressus Numerantium, 144: 161--182 , 2000 . A. Abdalla, N. Deo, and P. Gupta. Random-tree diameter and the diameter constrained MST. Congressus Numerantium, 144:161--182, 2000."},{"key":"e_1_3_2_1_2_1","first-page":"51","article-title":"Computational methods for the diameter restricted minimum weight spanning tree problem","volume":"10","author":"Achuthan N. R.","year":"1994","unstructured":"N. R. Achuthan , L. Caccetta , P. Caccetta , and J. F. Geelen . Computational methods for the diameter restricted minimum weight spanning tree problem . Australasian Journal of Combinatorics , 10 : 51 -- 71 , 1994 . N. R. Achuthan, L. Caccetta, P. Caccetta, and J. F. Geelen. Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian Journal of Combinatorics, 10:51--71, 1994.","journal-title":"Australasian Journal of Combinatorics"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253399"},{"key":"e_1_3_2_1_4_1","volume-title":"OR-Library: Euclidean Steiner problem","author":"Beasley J.","year":"2005","unstructured":"J. Beasley . OR-Library: Euclidean Steiner problem , 2005 . http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/esteininfo.html. J. Beasley. OR-Library: Euclidean Steiner problem, 2005. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/esteininfo.html."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90214-T"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(91)90030-D"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.210"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24838-5_34"},{"key":"e_1_3_2_1_10_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , New York , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10069"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v44:4"},{"key":"e_1_3_2_1_13_1","first-page":"178","volume-title":"Proceedings of the 2nd International Network Optimization Conference","volume":"1","author":"Gruber M.","year":"2005","unstructured":"M. Gruber and G. R. Raidl . A new 0--1 ILP approach for the bounded diameter minimum spanning tree problem. In L. Gouveia and C. Mour\u00e3o, editors , Proceedings of the 2nd International Network Optimization Conference , volume 1 , pages 178 -- 185 , Lisbon, Portugal , 2005 . M. Gruber and G. R. Raidl. A new 0--1 ILP approach for the bounded diameter minimum spanning tree problem. In L. Gouveia and C. Mour\u00e3o, editors, Proceedings of the 2nd International Network Optimization Conference, volume 1, pages 178--185, Lisbon, Portugal, 2005."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search","author":"Gruber M.","year":"2005","unstructured":"M. Gruber and G. R. Raidl . Variable neighborhood search for the bounded diameter minimum spanning tree problem. In P. Hansen, N. Mladenovi\u0107, J. A. M. P\u00e9rez, B. M. Batista, and J. M. Moreno-Vega, editors , Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search , Tenerife, Spain , 2005 . M. Gruber and G. R. Raidl. Variable neighborhood search for the bounded diameter minimum spanning tree problem. In P. Hansen, N. Mladenovi\u0107, J. A. M. P\u00e9rez, B. M. Batista, and J. M. Moreno-Vega, editors, Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain, 2005."},{"key":"e_1_3_2_1_15_1","first-page":"433","volume-title":"An introduction to variable neighborhood search","author":"Hansen P.","year":"1999","unstructured":"P. Hansen and N. Mladenovi\u0107 . An introduction to variable neighborhood search . In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Meta-heuristics, Advances and Trends in Local Search Paradigms for Optimization, pages 433 -- 458 . Kluwer Academic Publishers , 1999 . P. Hansen and N. Mladenovi\u0107. An introduction to variable neighborhood search. In S. Voss, S. Martello, I. Osman, and C. Roucairol, editors, Meta-heuristics, Advances and Trends in Local Search Paradigms for Optimization, pages 433--458. Kluwer Academic Publishers, 1999."},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"1282","volume-title":"K. Deb et al.","author":"Julstrom B. A.","year":"2004","unstructured":"B. A. Julstrom . Encoding bounded-diameter minimum spanning trees with permutations and with random keys . In K. Deb et al. , editors, Genetic and Evolutionary Computation Conference -- GECCO 2004 , volume 3102 of LNCS , pages 1282 -- 1281 . Springer , 2004. B. A. Julstrom. Encoding bounded-diameter minimum spanning trees with permutations and with random keys. In K. Deb et al., editors, Genetic and Evolutionary Computation Conference -- GECCO 2004, volume 3102 of LNCS, pages 1282--1281. Springer, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1498699"},{"key":"e_1_3_2_1_18_1","first-page":"2","volume-title":"2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Desgn of Representations","author":"Julstrom B. A.","year":"2003","unstructured":"B. A. Julstrom and G. R. Raidl . A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In A. Barry, F. Rothlauf, D. Thierens, et al., editors , in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Desgn of Representations , pages 2 -- 7 , 2003 . B. A. Julstrom and G. R. Raidl. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In A. Barry, F. Rothlauf, D. Thierens, et al., editors, in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Desgn of Representations, pages 2--7, 2003."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952678"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/58564.59295"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T11:30:35Z","timestamp":1690371035000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":20,"alternative-id":["10.1145\/1143997.1144185","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144185","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}