{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:23:55Z","timestamp":1725564235663},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205890"},{"type":"electronic","value":"9783540245803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24580-3_11","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:46Z","timestamp":1283713306000},"page":"29-42","source":"Crossref","is-referenced-by-count":10,"title":["Golomb Rulers: The Advantage of Evolution"],"prefix":"10.1007","author":[{"given":"Francisco B.","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Tavares","sequence":"additional","affiliation":[]},{"given":"Ernesto","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/B978-1-4832-3187-7.50008-8","volume-title":"Graph Theory and Computing","author":"S. Golomb","year":"1972","unstructured":"Golomb, S.: How to Number a Graph. In: Graph Theory and Computing, pp. 23\u201337. Academic Press, London (1972)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"G. Bloom","year":"1977","unstructured":"Bloom, G., Golomb, S.: Applications of numbered undirected graphs. Proceedings of the IEEE\u00a065, 562\u2013570 (1977)","journal-title":"Proceedings of the IEEE"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1109\/18.651068","volume":"44","author":"A. Dollas","year":"1998","unstructured":"Dollas, A., Rankin, W., McCracken, D.: New algorithms for golomb ruler derivation and proof of the 19 mark ruler. IEEE Transactions on Information Theory\u00a044, 379\u2013382 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR4","first-page":"108","volume":"AP-22","author":"E. Blum","year":"1974","unstructured":"Blum, E., Biraud, F., Ribes, J.: On optimal synthetic linear arrays with applications to radioastronomy. IEEE Transactions on Antennas and Propagation\u00a0AP-22, 108\u2013109 (1974)","journal-title":"IEEE Transactions on Antennas and Propagation"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1511\/1998.21.3408","volume":"86","author":"B. Hayes","year":"1998","unstructured":"Hayes, B.: Collective wisdom. American Scientist\u00a086, 118\u2013122 (1998)","journal-title":"American Scientist"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Klove, T.: Bounds and construction for difference triangle sets. IEEE Transactions on Information Theory IT-35 (1989)","DOI":"10.1109\/18.32165"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. Bean","year":"1994","unstructured":"Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing\u00a06, 154\u2013160 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"11_CR8","first-page":"528","volume-title":"Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA 1995)","author":"S. Soliday","year":"1995","unstructured":"Soliday, S., Homaifar, A., Lebby, G.: Genetic algorithm approach to the search for golomb rulers. In: Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA 1995), pp. 528\u2013535. Morgan Kaufmann, San Francisco (1995)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Dewdney, A.: Computer recreations. Scientific American, 16\u201326 (1985)","DOI":"10.1038\/scientificamerican0885-16"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical games. Scientific American, 198\u2013112 (1972)","DOI":"10.1038\/scientificamerican0372-108"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/18.50388","volume":"IT-36","author":"J. Shearer","year":"1990","unstructured":"Shearer, J.: Some new optimum golomb rulers. IEEE Transactions on Information Theory\u00a0IT-36, 183\u2013184 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR12","first-page":"407","volume-title":"Proceedings of the Fourth International Conference on Evolutionary Computation","author":"B. Norman","year":"1997","unstructured":"Norman, B., Smith, A.: Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems. In: Proceedings of the Fourth International Conference on Evolutionary Computation, pp. 407\u2013411. IEEE, Los Alamitos (1997)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1162\/106365602317301781","volume":"10","author":"F. Rothlauf","year":"2002","unstructured":"Rothlauf, F., Goldberg, D., Heinzl, A.D.: Network random keys - a tree representation scheme for genetic and evolutionary algorithms. Evolutionary Computation\u00a010, 75\u201397 (2002)","journal-title":"Evolutionary Computation"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/4235.850654","volume":"4","author":"G. Magyar","year":"2000","unstructured":"Magyar, G., Johnsson, G., Nevalainen, O.: An adaptive hybrid genetic algorithm fot the three-matching problem. IEEE Transactions on Evolutionary Computation\u00a04, 135\u2013146 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"11_CR15","first-page":"159","volume-title":"Proceedings of the IEEE International Conference on Evolutionary Computation","author":"P. Merz","year":"1997","unstructured":"Merz, P., Freisleben, B.: Genetic local search for the tsp: New results. In: Back, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 159\u2013164. IEEE Press, Los Alamitos (1997)"},{"key":"11_CR16","first-page":"221","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic Algorithms: a Short Introduction. In: New Ideas in Optimization, pp. 221\u2013234. McGraw-Hill, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24580-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:13:24Z","timestamp":1559582004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24580-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205890","9783540245803"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24580-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}