{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:12:37Z","timestamp":1750173157634},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75514-2_13","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T10:34:24Z","timestamp":1190198064000},"page":"170-184","source":"Crossref","is-referenced-by-count":6,"title":["A Memetic Algorithm for the Optimum Communication Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Merz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum Communication Spanning Trees. SIAM Journal of Computing\u00a03(3), 188\u2013195 (1974)","journal-title":"SIAM Journal of Computing"},{"key":"13_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA, USA (1979)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","volume":"102","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation algorithms for some optimum communication spanning tree problems. Discr. Appl. Math.\u00a0102(3), 245\u2013266 (2000)","journal-title":"Discr. Appl. Math."},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/trsc.21.3.163","volume":"21","author":"R.K. Ahuja","year":"1987","unstructured":"Ahuja, R.K., Murty, V.V.S.: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem. Transp. Sci.\u00a021(3), 163\u2013170 (1987)","journal-title":"Transp. Sci."},{"key":"13_CR5","unstructured":"Palmer, C.C., Kershenbaum, A.: Two Algorithms for Finding Optimal Communication Spanning Trees. Technical Report RC 19394, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (1994)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Palmer, C.C., Kershenbaum, A.: Representing trees in genetic algorithms. In: Proceedings of the First IEEE Conf. Evo. Comp., vol.\u00a01, pp. 379\u2013384 (1994)","DOI":"10.1109\/ICEC.1994.349921"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Soak, S.M.: A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem. E89\u2013A(10), 2882\u20132893 (2006)","DOI":"10.1093\/ietfec\/e89-a.10.2882"},{"key":"13_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)"},{"key":"13_CR9","series-title":"The Morgan Kaufmann Series in Artificial Intelligence","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)"},{"key":"13_CR10","unstructured":"Merz, P.: Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, University of Siegen, Germany, Siegen, Germany (2000)"},{"key":"13_CR11","unstructured":"Rothlauf, F., Gerstacker, J., Heinzl, A.: On the Optimal Communication Spanning Tree Problem. Working Papers in Information Systems 10\/2003, University of Mannheim, Germany (2003)"},{"key":"13_CR12","unstructured":"Fischer, T.: Improved Local Search for Large Optimum Communication Spanning Tree Problems. In: MIC 2007. 7th Metaheuristics International Conference (2007)"},{"key":"13_CR13","unstructured":"Rothlauf, F., Heinzl, A.: Developing efficient metaheuristics for communication network problems by using problem-specific knowledge. Technical Report 9\/2004, University of Mannheim, Germany (2004)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T23:17:11Z","timestamp":1629760631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755135"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_13","relation":{},"subject":[]}}