{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:42Z","timestamp":1750219782089,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"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":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590575","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"215-218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3342-4538","authenticated-orcid":false,"given":"Li","family":"Hong","sequence":"first","affiliation":[{"name":"Fujian Agriculture and Forestry University, Fuzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9132-913X","authenticated-orcid":false,"given":"Yiwen","family":"Zhong","sequence":"additional","affiliation":[{"name":"Fujian Agriculture and Forestry University, Fuzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4279-6081","authenticated-orcid":false,"given":"Juan","family":"Lin","sequence":"additional","affiliation":[{"name":"Fujian Agriculture and Forestry University, Fuzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-012-0869-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631221"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-008-9080-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144185"},{"key":"e_1_3_2_1_5_1","unstructured":"Bryant Julstrom and G\u00fcnther Raidl. 2003. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. Citeseer.  Bryant Julstrom and G\u00fcnther Raidl. 2003. A permutation-coded evolutionary algorithm for the bounded-diameter minimum spanning tree problem. Citeseer."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_122"},{"key":"e_1_3_2_1_7_1","volume-title":"C Daniel Gelatt Jr, and Mario P Vecchi","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C Daniel Gelatt Jr, and Mario P Vecchi . 1983 . Optimization by simulated annealing. science 220, 4598 (1983), 671--680. Scott Kirkpatrick, C Daniel Gelatt Jr, and Mario P Vecchi. 1983. Optimization by simulated annealing. science 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-009-9430-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952678"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-006-0142-y"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-05913-z"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12610"}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:44Z","timestamp":1750178264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":12,"alternative-id":["10.1145\/3583133.3590575","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590575","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}