{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:49:01Z","timestamp":1694652541462},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tevc.2010.2093580","type":"journal-article","created":{"date-parts":[[2011,9,28]],"date-time":"2011-09-28T03:28:41Z","timestamp":1317180521000},"page":"108-116","source":"Crossref","is-referenced-by-count":2,"title":["Edge Orientation and the Design of Problem-Specific Crossover Operators for the OCST Problem"],"prefix":"10.1109","volume":"16","author":[{"given":"Wolfgang","family":"Steitz","sequence":"first","affiliation":[]},{"given":"Franz","family":"Rothlauf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389205"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/372202.372353"},{"key":"ref30","author":"kershenbaum","year":"1993","journal-title":"Telecommunications Network Design Algorithms"},{"key":"ref10","first-page":"670","article-title":"Deterministic polylog approximation for minimum communication spanning trees","author":"peleg","year":"1998","journal-title":"Proc 25th ICALP"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00212-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1088"},{"key":"ref13","author":"palmer","year":"1994","journal-title":"An approach to a problem in network design using genetic algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/10721187_12"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301781"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2882"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75514-2_13"},{"key":"ref18","author":"zipf","year":"1949","journal-title":"Human Behaviour and the Principle of Least Effort An Introduction to Human Ecology"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.165464"},{"key":"ref28","first-page":"104","article-title":"An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem","author":"raidl","year":"2000","journal-title":"Proc Congr Evol Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0592"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-006-7382-1"},{"key":"ref6","author":"reshef","year":"1999","journal-title":"Approximating minimum communication cost spanning trees and related problems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2008799"},{"key":"ref5","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"key":"ref2","author":"rothlauf","year":"2006","journal-title":"Representations for Genetic and Evolutionary Algorithms"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1201\/9780203497289","author":"wu","year":"2004","journal-title":"Spanning Trees and Optimization Problems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"ref20","author":"poosala","year":"1997","journal-title":"Zipf's law"},{"key":"ref22","first-page":"238","article-title":"Tree network design with genetic algorithms: An investigation in the locality of the Prüfernumber encoding","author":"rothlauf","year":"1999","journal-title":"Proc Genetic Evol Comput Conf Late Breaking Papers"},{"key":"ref21","author":"rothlauf","year":"2007","journal-title":"Design and application of metaheuristics"},{"key":"ref24","first-page":"742","article-title":"Neuer beweis eines satzes über permutationen","volume":"27","author":"prfer","year":"1918","journal-title":"Arch Math Phys"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666886"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/508791.508898"},{"key":"ref25","author":"even","year":"1973","journal-title":"Algorithmic Combinatorics"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6141203\/06025280.pdf?arnumber=6025280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:36Z","timestamp":1633909656000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6025280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2010.2093580","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}