{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:02Z","timestamp":1750306322024,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908812.2908860","type":"proceedings-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T15:32:51Z","timestamp":1469633571000},"page":"333-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs"],"prefix":"10.1145","author":[{"given":"Angus","family":"Kenny","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A K.","family":"Qin","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"key":"e_1_3_2_1_2_1","volume-title":"On the history of the euclidean steiner tree problem. Archive for history of exact sciences, 68(3):327--354","author":"Brazil M.","year":"2014","unstructured":"M. Brazil , R. L. Graham , D. A. Thomas , and M. Zachariasen . On the history of the euclidean steiner tree problem. Archive for history of exact sciences, 68(3):327--354 , 2014 . M. Brazil, R. L. Graham, D. A. Thomas, and M. Zachariasen. On the history of the euclidean steiner tree problem. Archive for history of exact sciences, 68(3):327--354, 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0255-1_4"},{"key":"e_1_3_2_1_4_1","first-page":"313","volume-title":"Nature inspired cooperative strategies for optimization (NICSO","author":"Consoli S.","year":"2007","unstructured":"S. Consoli , J. M. P\u00e9rez , K. Darby-Dowman , and N. Mladenovi\u0107 . Discrete particle swarm optimization for the minimum labelling steiner tree problem . In Nature inspired cooperative strategies for optimization (NICSO 2007 ), pages 313 -- 322 . Springer , 2008. S. Consoli, J. M. P\u00e9rez, K. Darby-Dowman, and N. Mladenovi\u0107. Discrete particle swarm optimization for the minimum labelling steiner tree problem. In Nature inspired cooperative strategies for optimization (NICSO 2007), pages 313--322. Springer, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/03052159108941063"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3171-2_10"},{"key":"e_1_3_2_1_8_1","volume-title":"Greedy randomized adaptive search procedures. Journal of global optimization, 6(2):109--133","author":"Feo T. A.","year":"1995","unstructured":"T. A. Feo and M. G. Resende . Greedy randomized adaptive search procedures. Journal of global optimization, 6(2):109--133 , 1995 . T. A. Feo and M. G. Resende. Greedy randomized adaptive search procedures. Journal of global optimization, 6(2):109--133, 1995."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220105"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_12_1","first-page":"760","volume-title":"Encyclopedia of Machine Learning","author":"Kennedy J.","year":"2010","unstructured":"J. Kennedy . Particle swarm optimization. In Encyclopedia of Machine Learning , pages 760 -- 766 . Springer , 2010 . J. Kennedy. Particle swarm optimization. In Encyclopedia of Machine Learning, pages 760--766. Springer, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_125"},{"key":"e_1_3_2_1_15_1","first-page":"56","volume-title":"Hybrid Metaheuristics","author":"Leitner M.","year":"2014","unstructured":"M. Leitner , I. Ljubi\u0107 , M. Luipersbeck , and M. Resch . A partition-based heuristic for the steiner tree problem in large graphs . In Hybrid Metaheuristics , pages 56 -- 70 . Springer , 2014 . M. Leitner, I. Ljubi\u0107, M. Luipersbeck, and M. Resch. A partition-based heuristic for the steiner tree problem in large graphs. In Hybrid Metaheuristics, pages 56--70. Springer, 2014."},{"key":"e_1_3_2_1_16_1","volume-title":"Technische Universitat","author":"Ljubic I.","year":"2004","unstructured":"I. Ljubic . Exact and memetic algorithms for two network design problems. PhD thesis , Technische Universitat , Wien , 2004 . I. Ljubic. Exact and memetic algorithms for two network design problems. PhD thesis, Technische Universitat, Wien, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1090\/dimacs\/043\/08","volume-title":"Randomization Methods in Algorithm Design: DIMACS Workshop, Dec 12--14","volume":"43","author":"Martins S.","year":"1997","unstructured":"S. Martins . Greedy randomized adaptive search procedures for the steiner problem in graphs . In Randomization Methods in Algorithm Design: DIMACS Workshop, Dec 12--14 , 1997 , volume 43 , page 133 . American Mathematical Soc., 1999. S. Martins. Greedy randomized adaptive search procedures for the steiner problem in graphs. In Randomization Methods in Algorithm Design: DIMACS Workshop, Dec 12--14, 1997, volume 43, page 133. American Mathematical Soc., 1999."},{"key":"e_1_3_2_1_18_1","volume-title":"Theoretical aspects of local search","author":"Michiels W.","year":"2007","unstructured":"W. Michiels , E. Aarts , and J. Korst . Theoretical aspects of local search . Springer Science & Business Media , 2007 . W. Michiels, E. Aarts, and J. Korst. Theoretical aspects of local search. Springer Science & Business Media, 2007."},{"key":"e_1_3_2_1_19_1","first-page":"163","volume-title":"2013 IEEE RIVF International Conference on","author":"Nguyen T.-D.","year":"2013","unstructured":"T.-D. Nguyen and P.-T. Do . An ant colony optimization algorithm for solving group steiner problem. In Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF) , 2013 IEEE RIVF International Conference on , pages 163 -- 168 . IEEE, 2013 . T.-D. Nguyen and P.-T. Do. An ant colony optimization algorithm for solving group steiner problem. In Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), 2013 IEEE RIVF International Conference on, pages 163--168. IEEE, 2013."},{"key":"e_1_3_2_1_20_1","unstructured":"T. Polzin. Algorithms for the Steiner Problem in Networks. PhD thesis Universit\\\"atsbibliothek 2003.  T. Polzin. Algorithms for the Steiner Problem in Networks. PhD thesis Universit\\\"atsbibliothek 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-44436-X_22","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"Polzin T.","year":"2000","unstructured":"T. Polzin and S. Vahdati . Primal-dual approaches to the steiner problem . In Approximation Algorithms for Combinatorial Optimization , pages 214 -- 225 . Springer , 2000 . T. Polzin and S. Vahdati. Primal-dual approaches to the steiner problem. In Approximation Algorithms for Combinatorial Optimization, pages 214--225. Springer, 2000."},{"key":"e_1_3_2_1_22_1","volume-title":"Shortest connection networks and some generalizations. Bell system technical journal, 36(6):1389--1401","author":"Prim R. C.","year":"1957","unstructured":"R. C. Prim . Shortest connection networks and some generalizations. Bell system technical journal, 36(6):1389--1401 , 1957 . R. C. Prim. Shortest connection networks and some generalizations. Bell system technical journal, 36(6):1389--1401, 1957."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9198-2"},{"key":"e_1_3_2_1_24_1","volume-title":"Ant colony algorithms for steiner trees: An application to routing in. Recent Developments in Biologically Inspired Computing, page 181","author":"Singh G.","year":"2005","unstructured":"G. Singh , S. Das , S. V. Gosavi , and S. Pujar . Ant colony algorithms for steiner trees: An application to routing in. Recent Developments in Biologically Inspired Computing, page 181 , 2005 . G. Singh, S. Das, S. V. Gosavi, and S. Pujar. Ant colony algorithms for steiner trees: An application to routing in. Recent Developments in Biologically Inspired Computing, page 181, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-006-8202-2"},{"issue":"6","key":"e_1_3_2_1_26_1","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","unstructured":"H. Takahashi and A. Matsuyama . An approximate solution for the steiner problem in graphs . Math. Japonica , 24 ( 6 ): 573 -- 577 , 1980 . H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. Math. Japonica, 24(6):573--577, 1980.","journal-title":"Math. Japonica"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10035"},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"ALENEX","author":"Uchoa E.","year":"2010","unstructured":"E. Uchoa and R. F. F. Werneck . Fast local search for steiner trees in graphs . In ALENEX , volume 10 , pages 1 -- 10 . SIAM , 2010 . E. Uchoa and R. F. F. Werneck. Fast local search for steiner trees in graphs. In ALENEX, volume 10, pages 1--10. SIAM, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-1-4757-3171-2_12","volume-title":"Advances in Steiner Trees","author":"Wade A.","year":"2000","unstructured":"A. Wade and V. Rayward-Smith . Effective local search techniques for the steiner tree problem . In Advances in Steiner Trees , pages 255 -- 281 . Springer , 2000 . A. Wade and V. Rayward-Smith. Effective local search techniques for the steiner tree problem. In Advances in Steiner Trees, pages 255--281. Springer, 2000."}],"event":{"name":"GECCO '16: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Denver Colorado USA","acronym":"GECCO '16"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference 2016"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908812.2908860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:19Z","timestamp":1750222459000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":28,"alternative-id":["10.1145\/2908812.2908860","10.1145\/2908812"],"URL":"https:\/\/doi.org\/10.1145\/2908812.2908860","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}