{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:55:47Z","timestamp":1761807347196},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,6,21]],"date-time":"2007-06-21T00:00:00Z","timestamp":1182384000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10601-007-9020-1","type":"journal-article","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T19:22:30Z","timestamp":1182367350000},"page":"263-291","source":"Crossref","is-referenced-by-count":22,"title":["Local Search-based Hybrid Algorithms for Finding Golomb Rulers"],"prefix":"10.1007","volume":"12","author":[{"given":"Carlos","family":"Cotta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iv\u00e1n","family":"Dot\u00fa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio J.","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,21]]},"reference":[{"issue":"1","key":"9020_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B. Adenso-D\u00edaz","year":"2006","unstructured":"Adenso-D\u00edaz, B., & Laguna, M. (2006). Fine tuning of algorithms using fractional experimental designs and local search. Operations Research, 54(1), 99\u2013114.","journal-title":"Operations Research"},{"key":"9020_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/j.1538-7305.1953.tb01422.x","volume":"32","author":"W. C. Babcock","year":"1953","unstructured":"Babcock, W. C. (1953). Intermodulation interference in radio systems. Bell Systems Technical Journal, 32, 63\u201373.","journal-title":"Bell Systems Technical Journal"},{"key":"9020_CR3","first-page":"7","volume-title":"5th workshop on constraint programming for decision and control","author":"R. Bart\u00e1k","year":"2003","unstructured":"Bart\u00e1k, R. (2003). Practical constraints: A tutorial on modelling with constraints. In J. Figwer (Ed.), 5th workshop on constraint programming for decision and control (pp. 7\u201317). Poland: Gliwice."},{"key":"9020_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. Bean","year":"1994","unstructured":"Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"key":"9020_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-24652-7_3","volume-title":"Evolutionary computation in combinatorial optimization","author":"C. Bierwirth","year":"2004","unstructured":"Bierwirth, C., Mattfeld, D.C., & Watson, J.-P. (2004). Landscape regularity and random walks for the job shop scheduling problem. In J. Gottlieb, & G. R. Raidl (Eds.), Evolutionary computation in combinatorial optimization. Lecture Notes in Computer Science, Vol. 3004 (pp. 21\u201330). Berlin: Springer."},{"key":"9020_CR6","first-page":"11","volume-title":"2002 Genetic and evolutionary computation conference (GECCO)","author":"M. Birattari","year":"2002","unstructured":"Birattari, M., St\u00fctzle, T. Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Lagndon et\u00a0al. (Eds.), 2002 Genetic and evolutionary computation conference (GECCO) (pp. 11\u201318). San Francisco, CA: Morgan Kaufmann."},{"issue":"1","key":"9020_CR7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TAP.1974.1140732","volume":"22","author":"F. Biraud","year":"1974","unstructured":"Biraud, F., Blum, E., & Ribes, J. (1974). On optimum synthetic linear arrays with applications to radioastronomy. IEEE Transactions on Antennas and Propagation, 22(1), 108\u2013109.","journal-title":"IEEE Transactions on Antennas and Propagation"},{"issue":"4","key":"9020_CR8","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"G. S. Bloom","year":"1977","unstructured":"Bloom, G. S., & Golomb, S. W. (1977). Aplications of numbered undirected graphs. Proceedings of the IEEE, 65(4), 562\u2013570.","journal-title":"Proceedings of the IEEE"},{"key":"9020_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K. D. Boese","year":"1994","unstructured":"Boese, K. D., Kahng, A. B., & Muddu, S. (1994). A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16, 101\u2013113.","journal-title":"Operations Research Letters"},{"key":"9020_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/11844297_26","volume-title":"Parallel problem solving from nature IX","author":"C. Cotta","year":"2006","unstructured":"Cotta, C., Dot\u00fa, I., Fern\u00e1ndez, A. J., & Van Hentenryck, P. (2006). A memetic approach to golomb rulers. In T. P. Runarsson et\u00a0al. (Eds.), Parallel problem solving from nature IX. Lecture notes in computer science, vol. 4193 (pp. 252\u2013261). Berlin Heidelberg: Springer-Verlag."},{"key":"9020_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-540-30217-9_49","volume-title":"Parallel problem solving from nature VIII","author":"C. Cotta","year":"2004","unstructured":"Cotta, C., & Fern\u00e1ndez, A. J. (2004.) A hybrid GRASP-evolutionary algorithm approach to Golomb ruler search. In Xin Yao et\u00a0al. (Eds.), Parallel problem solving from nature VIII. Lecture notes in computer science, vol. 3242 (pp. 481\u2013490). Berlin Heidelberg: Springer."},{"key":"9020_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-540-31996-2_7","volume-title":"Evolutionary computation in combinatorial optimization","author":"C. Cotta","year":"2005","unstructured":"Cotta, C., & Fern\u00e1ndez, A. J. (2005). Analyzing fitness landscapes for the optimal Golomb ruler problem. In J. Gottlieb & G. R. Raidl (Eds.), Evolutionary computation in combinatorial optimization. Lecture notes in computer science, vol. 3248 (pp. 68\u201379). Berlin Heidelberg: Springer."},{"issue":"2","key":"9020_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1021934325079","volume":"18","author":"C. Cotta","year":"2003","unstructured":"Cotta, C., & Troya, J. M. (2003). Embedding branch and bound within evolutionary algorithms. Applied Intelligence, 18(2), 137\u2013153.","journal-title":"Applied Intelligence"},{"key":"9020_CR14","series-title":"Lecture notes in computer science","first-page":"81","volume-title":"2nd International workshop on practical aspects of declarative languages (PADL\u20192000)","author":"D. D\u00edaz","year":"2000","unstructured":"D\u00edaz, D., & Codognet, P. (2000). GNU Prolog: Beyond compiling Prolog to C. In E. Pontelli, & V. Santos Costa (Eds.), 2nd International workshop on practical aspects of declarative languages (PADL\u20192000). Lecture notes in computer science, vol. 1753 (pp. 81\u201392). Boston, MA: Springer."},{"key":"9020_CR15","doi-asserted-by":"crossref","unstructured":"Dewdney, A. K. (1985). The search for an invisible ruler that will help radio astronomers measure the Earth, computer recreations. Scientific American, Dec: 16\u201326.","DOI":"10.1038\/scientificamerican0885-16"},{"key":"9020_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/18.651068","volume":"44","author":"A. Dollas","year":"1998","unstructured":"Dollas, A., Rankin, W. T., & McCracken, D. (1998). A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler. IEEE Transactions on Information Theory, 44, 379\u2013382.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9020_CR17","doi-asserted-by":"crossref","first-page":"2018","DOI":"10.1109\/CEC.2005.1554943","volume-title":"2005 Congress on evolutionary computation (CEC2005), vol. 3","author":"I. Dot\u00fa","year":"2005","unstructured":"Dot\u00fa, I., & Van Hentenryck, P. (2005). A simple hybrid evolutionary algorithm for finding golomb rulers. In D. W. Corne et\u00a0al. (Eds.), 2005 Congress on evolutionary computation (CEC2005), vol. 3 (pp. 2018\u20132023). Edinburgh, Scotland: IEEE."},{"key":"9020_CR18","first-page":"227","volume":"7","author":"R. J. F. Fang","year":"1977","unstructured":"Fang, R. J. F., & Sandrin, W. A. (1977). Carrier frequency assignment for non-linear repeaters. Comsat Technical Review, 7, 227\u2013245.","journal-title":"Comsat Technical Review"},{"key":"9020_CR19","unstructured":"Feeney, B. (2003) Determining Optimum and Near-optimum Golomb Rulers Using Genetic Algorithms. Master thesis, Computer Science, University College Cork (October)."},{"key":"9020_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"9020_CR21","unstructured":"Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (2001). A constraint-based approach to the Golomb ruler problem. In 3rd International workshop on integration of AI and OR techniques (CP-AI-OR\u20192001)."},{"key":"9020_CR22","unstructured":"Garry, M., Vanderschel, D., et\u00a0al. (1999). In search of the optimal 20, 21 & 22 mark Golomb rulers. GVANT project. http:\/\/members.aol.com\/golomb20\/index.html ."},{"issue":"2","key":"9020_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/10586458.1994.10504286","volume":"3","author":"P. Gilbert","year":"1994","unstructured":"Gilbert, P., & Postpischil, E. (1994). There are no new homometric Golomb ruler pairs with 12 marks or less. Experimental Mathematics, 3(2), 147\u2013152.","journal-title":"Experimental Mathematics"},{"key":"9020_CR24","doi-asserted-by":"crossref","unstructured":"Giraud-Carrier, C. (2002). Unifying learning with evolution through Baldwinian evolution and lamarckism: A case study. In H-J. Zimmermann, G.\u00a0Tselentis, M.\u00a0van Someren, & G.\u00a0Dounias (Eds.), Advances in computational intelligence and learning: Methods and applications (pp. 159\u2013168). Kluwer.","DOI":"10.1007\/978-94-010-0324-7_11"},{"issue":"3","key":"9020_CR25","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989a","unstructured":"Glover, F. (1989a). Tabu search\u2014Part I. ORSA Journal of Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal of Computing"},{"issue":"1","key":"9020_CR26","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1989b","unstructured":"Glover, F. (1989b). Tabu search\u2014Part II. ORSA Journal of Computing, 2(1), 4\u201331.","journal-title":"ORSA Journal of Computing"},{"key":"9020_CR27","first-page":"13","volume":"1363","author":"F. Glover","year":"1997","unstructured":"Glover, F. (1997). A template for scatter search and path relinking. Lecture Notes in Computer Science, 1363, 13\u201354.","journal-title":"Lecture Notes in Computer Science"},{"key":"9020_CR28","volume-title":"Proceedings of an international conference on genetic algorithms","author":"D. E. Goldberg","year":"1985","unstructured":"Goldberg, D. E., & Lingle\u00a0Jr., D. E., (1985). Alleles, loci and the traveling salesman problem. In J. J. Grefenstette (Ed.), Proceedings of an international conference on genetic algorithms. Hillsdale: Lawrence Erlbaum Associates."},{"issue":"1","key":"9020_CR29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/evco.1997.5.1.31","volume":"5","author":"C. Houck","year":"1997","unstructured":"Houck, C., Joines, J. A., Kay, M. G., & Wilson, J. R. (1997). Empirical investigation of the benefits of partial lamarckianism. Evolutionary Computation, 5(1), 31\u201360.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"9020_CR30","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. K. Jain","year":"1999","unstructured":"Jain, A. K., Murty, N. M., & Flynn, P. J. (1999). Data clustering: A review. ACM Computing Surveys, 31(3), 264\u2013323.","journal-title":"ACM Computing Surveys"},{"key":"9020_CR31","unstructured":"Jones, T. (1995). Evolutionary Algorithms, Fitness Landscapes and Search. Ph.D. Thesis, Santa Fe Institute, University of New Mexico, Alburquerque (May)."},{"key":"9020_CR32","first-page":"184","volume-title":"Proceedings of the 6th international conference on genetic algorithms","author":"T. Jones","year":"1995","unstructured":"Jones, T., & Forrest, S. (1995). Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L. J. Eshelman (Ed.), Proceedings of the 6th international conference on genetic algorithms (pp. 184\u2013192). San Francisco, CA: Morgan Kaufmann."},{"key":"9020_CR33","unstructured":"Julstrom, B. A. (1999). Comparing darwinian, baldwinian, and lamarckian search in a genetic algorithm for the 4-cycle problem. In S.\u00a0Brave, & A.S. Wu. (Ed.), Late breaking papers at the 1999 genetic and evolutionary computation conference, Orlando, FL (pp. 134\u2013138)."},{"key":"9020_CR34","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/18.32165","volume":"35","author":"T. Klove","year":"1989","unstructured":"Klove, T. (1989). Bounds and construction for difference triangle sets. IEEE Transactions on Information Theory, 35, 879\u2013886 (July).","journal-title":"Transactions on Information Theory"},{"key":"9020_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter search. Methodology and implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., & Mart\u00ed, R. (2003). Scatter search. Methodology and implementations in C. Boston, MA: Kluwer."},{"key":"9020_CR36","volume-title":"Nonparametrics: Statistical methods based on rRanks","author":"E. L. Lehmann","year":"1998","unstructured":"Lehmann, E. L., & D\u2019Abrera, H. J. M. (1998). Nonparametrics: Statistical methods based on rRanks. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"9020_CR37","first-page":"281","volume-title":"5-th Berkeley symposium on mathematical statistics and probability, vol.\u00a01","author":"J. B. MacQueen","year":"1967","unstructured":"MacQueen, J.\u00a0B. (1967). Some methods for classification and analysis of multivariate observations. In 5-th Berkeley symposium on mathematical statistics and probability, vol.\u00a01 (pp. 281\u2013297). Berkeley: University of California Press."},{"key":"9020_CR38","first-page":"143","volume-title":"Proceedings of the fourth international conference on genetic algorithms","author":"B. Manderick","year":"1991","unstructured":"Manderick, B., de\u00a0Weger, M., & Spiessens, P. (1991). The genetic algorithm and the structure of the fitness landscape. In R. K. Belew, & L. B. Booker (Eds.), Proceedings of the fourth international conference on genetic algorithms (pp. 143\u2013150). San Mateo, CA: Morgan Kaufmann."},{"key":"9020_CR39","unstructured":"McCracken, D. (1991). Minimum redundancy linear arrays. Senior Thesis, Duke University, Durham, NC (January)."},{"key":"9020_CR40","volume-title":"Discrete location theory","author":"P. Mirchandani","year":"1990","unstructured":"Mirchandani, P., & Francis, R. (1990). Discrete location theory. New York: Wiley."},{"key":"9020_CR41","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P. (1999). Memetic algorithms: A short introduction. In D.\u00a0Corne, M.\u00a0Dorigo, & F.\u00a0Glover (Eds.), New ideas in optimization (pp. 219\u2013234). Maidenhead, Berkshire, UK: McGraw-Hill."},{"key":"9020_CR42","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of metaheuristics","author":"P. Moscato","year":"2003","unstructured":"Moscato, P. & Cotta, C. (2003). A gentle introduction to memetic algorithms. In F.\u00a0Glover, & G.\u00a0Kochenberger (Eds.), Handbook of metaheuristics (pp. 105\u2013144). Boston, MA: Kluwer."},{"key":"9020_CR43","first-page":"27-1","volume-title":"Handbook of approximation algorithms and metaheuristics, chapter\u00a027","author":"P. Moscato","year":"2007","unstructured":"Moscato, P., & Cotta, C. (2007). Memetic algorithms. In T.\u00a0Gonz\u00e1lez (Ed.), Handbook of approximation algorithms and metaheuristics, chapter\u00a027 (pp. 27-1\u201327-12). New York: Taylor & Francis."},{"key":"9020_CR44","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-540-39930-8_3","volume-title":"New optimization techniques in engineering","author":"P. Moscato","year":"2004","unstructured":"Moscato, P., Cotta, C., & Mendes, A. (2004). Memetic algorithms. In G. C. Onwubolu, & B. V. Babu (Eds.), New optimization techniques in engineering (pp. 53\u201385). Berlin Heidelberg: Springer."},{"key":"9020_CR45","unstructured":"OGR project (1998). http:\/\/www.distributed.net\/ogr\/ , on-going since September 14, 1998."},{"key":"9020_CR46","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-24580-3_11","volume-title":"Progress in artificial intelligence, 11th Portuguese conference on artificial intelligence","author":"F. B. Pereira","year":"2003","unstructured":"Pereira, F. B., Tavares, J., & Costa, E. (2003). Golomb rulers: The advantage of evolution. In F.\u00a0Moura-Pires, & S.\u00a0Abreu (Eds.), Progress in artificial intelligence, 11th Portuguese conference on artificial intelligence. Lecture notes in computer science, vol. 2902 (pp. 29\u201342). Berlin Heidelberg: Springer."},{"key":"9020_CR47","first-page":"1","volume":"9","author":"M. Prais","year":"2000","unstructured":"Prais, M., & Ribeiro, C. C. (2000a). Parameter variation in GRASP procedures. Investigaci\u00f3n Operativa, 9, 1\u201320.","journal-title":"Investigaci\u00f3n Operativa"},{"key":"9020_CR48","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., & Ribeiro, C. C. (2000b). Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12, 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"9020_CR49","unstructured":"Prestwich, S. (2001). Trading completeness for scalability: Hybrid search for cliques and rulers. In Third international workshop on the integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR-01), Ashford, Kent, England (pp. 159\u2013174)."},{"key":"9020_CR50","first-page":"183","volume":"5","author":"N. J. Radcliffe","year":"1991","unstructured":"Radcliffe, N. J. (1991). Equivalence class analysis of genetic algorithms. Complex Systems, 5, 183\u2013205.","journal-title":"Complex Systems"},{"key":"9020_CR51","unstructured":"Rankin, W. T. (1993). Optimal Golomb rulers: An exhaustive parallel search implementation. Master Thesis, Duke University Electrical Engineering Dept., Durham, NC (December)."},{"key":"9020_CR52","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"C. Reeves","year":"1999","unstructured":"Reeves, C. (1999). Landscapes, operators and heuristic search. Annals of Operational Research, 86, 473\u2013490.","journal-title":"Annals of Operational Research"},{"key":"9020_CR53","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M. G. C. Resende","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. In F.\u00a0Glover, & G.\u00a0Kochenberger (Eds.), Handbook of metaheuristics (pp. 219\u2013249). Boston, MA: Kluwer."},{"key":"9020_CR54","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/TIT.1987.1057336","volume":"33","author":"J. Robbins","year":"1987","unstructured":"Robbins, J., Gagliardi, R., & Taylor, H. (1987). Acquisition sequences in PPM communications. IEEE Transactions on Information Theory, 33, 738\u2013744.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9020_CR55","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1967.1053951","volume":"13","author":"J. P. Robinson","year":"1967","unstructured":"Robinson, J. P., & Bernstein, A. J. (1967). A class of binary recurrent codes with limited error propagation. IEEE Transactions on Information Theory, 13, 106\u2013113.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9020_CR56","unstructured":"Schneider, W. (2002). Golomb rulers. MATHEWS: The archive of recreational mathematics. http:\/\/www.wschnei.de\/number-theory\/golomb-rulers.html ."},{"key":"9020_CR57","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/18.50388","volume":"36","author":"J. B. Shearer","year":"1990","unstructured":"Shearer, J. B. (1990). Some new optimum Golomb rulers. IEEE Transactions on Information Theory, 36, 183\u2013184 (January).","journal-title":"IEEE Transactions on Information Theory"},{"key":"9020_CR58","unstructured":"Shearer, J.\u00a0B. (2001). Golomb ruler table. Mathematics Department, IBM Research. http:\/\/www.research.ibm.com\/people\/s\/shearer\/grtab.html ."},{"key":"9020_CR59","unstructured":"Smith, B.M., & Walsh, T. (1999). Modelling the Golomb ruler problem. In Workshop on non-binary constraints (IJCAI\u201999), Stockholm."},{"key":"9020_CR60","first-page":"528","volume-title":"6th International conference on genetic algorithms (ICGA\u201995)","author":"S. W. Soliday","year":"1995","unstructured":"Soliday, S. W., Homaifar, A., & Lebby, G. L. (1995). Genetic algorithm approach to the search for Golomb rulers. In L. J. Eshelman (Ed.), 6th International conference on genetic algorithms (ICGA\u201995) (pp. 528\u2013535). Pittsburgh, PA: Morgan Kaufmann."},{"key":"9020_CR61","first-page":"356","volume-title":"6th International congress on genetics, vol.\u00a01","author":"S. Wright","year":"1932","unstructured":"Wright, S. (1932). The roles of mutation, inbreeding, crossbreeding and selection in evolution. In D. F. Jones (Ed.), 6th International congress on genetics, vol.\u00a01 (pp. 356\u2013366). Menasha, WI: Brooklyn Botanic Garden."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9020-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-007-9020-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9020-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:13Z","timestamp":1559243653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-007-9020-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,21]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9020"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9020-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,21]]}}}