{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:53:35Z","timestamp":1725566015620},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223443"},{"type":"electronic","value":"9783540248545"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24854-5_123","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:40:42Z","timestamp":1284475242000},"page":"1282-1291","source":"Crossref","is-referenced-by-count":1,"title":["Three Evolutionary Codings of Rectilinear Steiner Arborescences"],"prefix":"10.1007","author":[{"given":"Bryant A.","family":"Julstrom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athos","family":"Antoniades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"123_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/43.673630","volume":"17","author":"J. Cong","year":"1998","unstructured":"Cong, J., Khang, A.B., Leung, K.S.: Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a017, 24\u201339 (1998)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"123_CR2","unstructured":"Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 780\u2013786 (2000)"},{"key":"123_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01758762","volume":"7","author":"S.K. Rao","year":"1992","unstructured":"Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica\u00a07, 277\u2013288 (1992)","journal-title":"Algorithmica"},{"key":"123_CR4","unstructured":"C\u00f3rdova, J., Lee, Y.H.: A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical Report TR-94-025, Department of Computer Science, University of Florida (1994)"},{"key":"123_CR5","unstructured":"Leung, K.S., Cong, J.: Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem. In: Proceedings of the International Symposium on Circuits and Systems, pp. 1568\u20131571 (1997)"},{"key":"123_CR6","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TCAD.2003.814249","volume":"22","author":"S. Ramnath","year":"2003","unstructured":"Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem. IEEE Transactions on Computer-Aided Design\u00a022, 859\u2013869 (2003)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"123_CR7","first-page":"356","volume-title":"Proceedings of the 16th ACM Symposium on Applied Computing, New York, ACM Press","author":"B.A. Julstrom","year":"2001","unstructured":"Julstrom, B.A.: Encoding rectilinear Steiner trees as lists of edges. In: Lamont, G.B., Yfantis, E.A., Haddad, H., Papadopoulos, G.A., Carroll, J. (eds.) Proceedings of the 16th ACM Symposium on Applied Computing, New York, ACM Press, pp. 356\u2013360. ACM Press, New York (2001)"},{"key":"123_CR8","unstructured":"Julstrom, B.A.: A hybrid evolutionary algorithm for the rectilinear Steiner problem. In: Barry, A. (ed.) 2003 Genetic and Evolutionary Computation Workshop Program, Chicago, IL, pp. 49\u201355 (2003)"},{"key":"123_CR9","first-page":"458","volume-title":"Proceedings of the Seventh International Conference on Genetic Algorithms","author":"C.L. Valenzuela","year":"1997","unstructured":"Valenzuela, C.L., Williams, L.P.: Improving simple heuristic algorithms for the traveling salesman problem using a genetic algorithm. In: B\u00e4ck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 458\u2013464. Morgan Kaufmann, San Francisco (1997)"},{"key":"123_CR10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1117\/12.326703","volume-title":"Proceedings of SPIE, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation","author":"J.P. Cohoon","year":"1998","unstructured":"Cohoon, J.P., Karro, J.E., Martin, W.N., Niebel, W.D.: Perturbation method for probabilistic search for the traveling salesperson problem. In: Proceedings of SPIE, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation, vol.\u00a03455, pp. 118\u2013127. SPIE Press, San Jose (1998)"},{"key":"123_CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"123_CR12","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A., Antoniades, A.: Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. In: Proceedings of the 2004 ACM Symposium on Applied Computing, Nicosia, Cyprus (2004)","DOI":"10.1145\/967900.968100"},{"key":"123_CR13","unstructured":"Goldberg, D.E., Robert Lingle, J.: Alleles, loci, and the traveling salesman problem, 18th edn., pp. 154\u2013159."},{"key":"123_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C.R. Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research\u00a022, 5\u201313 (1995)","journal-title":"Computers and Operations Research"},{"key":"123_CR15","unstructured":"Smith, D.: Bin packing with adaptive search, 18th edn., pp. 202\u2013207."},{"key":"123_CR16","unstructured":"Prosser, P.: A hybrid genetic algorithm for pallet loading. In: Proceedings of the 8th European Conference on Artificial Intelligence, London, Pitman (1988)"},{"key":"123_CR17","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"123_CR18","unstructured":"Greffenstette, J.J.: Proceedings of the First International Conference on Genetic Algorithms, Proceedings of the First International Conference on Genetic Algorithms, Hillsdale, NJ, Lawrence Erlbaum (1985)"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24854-5_123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:21:59Z","timestamp":1558290119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24854-5_123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223443","9783540248545"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24854-5_123","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}