{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:55Z","timestamp":1750307815478,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"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":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389205","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"563-570","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Orientation matters"],"prefix":"10.1145","author":[{"given":"Wolfgang","family":"Steitz","sequence":"first","affiliation":[{"name":"University of Mainz, Mainz, Germany"}]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[{"name":"University of Mainz, Mainz, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-75514-2_13","volume-title":"Hybrid Metaheuristics, 4th International Workshop, HM","author":"Fischer T.","year":"2007","unstructured":"T. Fischer and P. Merz . A memetic algorithm for the optimum communication spanning tree problem . In T. Bartz-Beielstein, M. J. B. Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors, Hybrid Metaheuristics, 4th International Workshop, HM 2007 , Dortmund, Germany, October 8-9, 2007, Proceedings, volume 4771 of LNCS , pages 170 -- 184 . Springer , 2007. T. Fischer and P. Merz. A memetic algorithm for the optimum communication spanning tree problem. In T. Bartz-Beielstein, M. J. B. Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, editors, Hybrid Metaheuristics, 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings, volume 4771 of LNCS, pages 170--184. Springer, 2007."},{"key":"e_1_3_2_1_2_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 & amp; Co., New York, NY, USA, 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/372202.372353"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.758833"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870282"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"e_1_3_2_1_10_1","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"Rothlauf F.","year":"2006","unstructured":"F. Rothlauf . Representations for Genetic and Evolutionary Algorithms . Heidelberg : Springer , 2 edition, 2006 . F. Rothlauf. Representations for Genetic and Evolutionary Algorithms. Heidelberg: Springer, 2 edition, 2006."},{"key":"e_1_3_2_1_11_1","volume-title":"Universitat Mannheim","author":"Rothlauf F.","year":"2007","unstructured":"F. Rothlauf . Design and Application of Metaheuristics . Universitat Mannheim , Habilitationsschrift , 2007 . F. Rothlauf. Design and Application of Metaheuristics. Universitat Mannheim, Habilitationsschrift, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301781"},{"key":"e_1_3_2_1_13_1","volume-title":"Department of Information Systems 1","author":"Rothlauf F.","year":"2003","unstructured":"F. Rothlauf and A. Heinzl . On optimal solutions for the optimal communication spanning tree problem. Technical report , Department of Information Systems 1 , University of Mannheim , 2003 . F. Rothlauf and A. Heinzl. On optimal solutions for the optimal communication spanning tree problem. Technical report, Department of Information Systems 1, University of Mannheim, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-006-7382-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2882"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_23"},{"key":"e_1_3_2_1_17_1","volume-title":"Spanning Trees and Optimization Problems. Discrete Mathematics and Its Applications","author":"Wu B. Y.","year":"2004","unstructured":"B. Y. Wu and K.-M. Chao . Spanning Trees and Optimization Problems. Discrete Mathematics and Its Applications . Chapman & amp; Hall\/CRC, 2004 . B. Y. Wu and K.-M. Chao. Spanning Trees and Optimization Problems. Discrete Mathematics and Its Applications. Chapman & Hall\/CRC, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00212-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1088"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389205"}},"subtitle":["how to efficiently solve ocst problems with problem-specific EAs"],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":18,"alternative-id":["10.1145\/1389095.1389205","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389205","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}