{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:03:25Z","timestamp":1760609005463},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,7,29]],"date-time":"2017-07-29T00:00:00Z","timestamp":1501286400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10732-017-9353-x","type":"journal-article","created":{"date-parts":[[2017,7,29]],"date-time":"2017-07-29T07:20:18Z","timestamp":1501312818000},"page":"501-532","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Constraint-based search for optimal Golomb rulers"],"prefix":"10.1007","volume":"23","author":[{"given":"M. M. A.","family":"Polash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A. H.","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"9353_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization, 1st edn. Wiley, New York (1997). ISBN 0471948225","edition":"1"},{"key":"9353_CR2","doi-asserted-by":"crossref","unstructured":"Ayari, N., Jemai, A.: Parallel hybrid evolutionary search for Golomb ruler problem. In: International Conference on Metaheuristics and Nature Inspired Computing, pp. 1\u201310, (2010)","DOI":"10.1109\/AICCSA.2010.5586955"},{"key":"9353_CR3","doi-asserted-by":"crossref","unstructured":"Ayari, N., Luong, T., Jemai, A.: A hybrid genetic algorithm for Golomb ruler problem. In: IEEE\/ACS International Conference on Computer Systems and Applications, pp. 1\u20134, (2010)","DOI":"10.1109\/AICCSA.2010.5586955"},{"key":"9353_CR4","doi-asserted-by":"crossref","unstructured":"Babcock, W.: Intermodulation interface in radio systems. Bell Syst. Tech. J. 32, 63\u201373 (1952)","DOI":"10.1002\/j.1538-7305.1953.tb01422.x"},{"key":"9353_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, G., Golomb, S.: Application of numbered undirected graphs. In: Proceedings of the IEEE, vol. 65, pp. 562\u2013570 (1977)","DOI":"10.1109\/PROC.1977.10517"},{"key":"9353_CR6","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TAP.1974.1140732","volume":"22","author":"E Blum","year":"1974","unstructured":"Blum, E., Biraud, F., Ribes, J.: On optimal synthetic linear arrays with applications to radioastronomy. IEEE Trans. Anntenas Propag. 22, 108\u2013109 (1974)","journal-title":"IEEE Trans. Anntenas Propag."},{"key":"9353_CR7","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K.: Local search with configuration checking for SAT. In: 23rd IEEE International Conference on Tools with Artificial Intelligence, pp. 59\u201366 (2011)","DOI":"10.1109\/ICTAI.2011.18"},{"issue":"9\u201310","key":"9353_CR8","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"9353_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10601-007-9020-1","volume":"12","author":"C Cotta","year":"2007","unstructured":"Cotta, C., Dotu, I., Fernandez, A., Hentenryck, P.: Local search based hybrid algorithm for finding Golomb rulers. Contraints 12, 263\u2013291 (2007)","journal-title":"Contraints"},{"key":"9353_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1038\/scientificamerican0986-14","volume":"255","author":"A Dewdney","year":"1986","unstructured":"Dewdney, A.: Computer recreations. Sci. Am. 255, 14\u201321 (1986)","journal-title":"Sci. Am."},{"key":"9353_CR11","unstructured":"Dimitromanolakis, A.: Analysis of the Golomb ruler and the sidon set problems, and determination of large, near-optimal Golomb rulers. Ph.D. thesis, Dept. of Electronic and Computer Engineering, Technical University of Crete, Greece, June (2002)"},{"key":"9353_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/18.651068","volume":"44","author":"A Dollas","year":"1998","unstructured":"Dollas, A., Rankin, W., McCracken, D.: A new algorithm for Golomb ruler derivation and proof of the 19-mark ruler. IEEE Trans. Inf. Theory 44, 379\u2013386 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9353_CR13","first-page":"2018","volume":"3","author":"I Dotu","year":"2005","unstructured":"Dotu, I., Hentenryck, P.: A simple hybrid evolutionary algorithm for finding Golomb rulers. IEEE Congr. Evol. Comput. 3, 2018\u20132023 (2005)","journal-title":"IEEE Congr. Evol. Comput."},{"issue":"3","key":"9353_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.3934\/amc.2009.3.235","volume":"3","author":"K Drakakis","year":"2009","unstructured":"Drakakis, K.: A review of the available construction methods for Golomb rulers. Adv. Math. Commun. 3(3), 235\u2013250 (2009)","journal-title":"Adv. Math. Commun."},{"key":"9353_CR15","unstructured":"Feeny, B.: Determining optimum and near-optimum Golomb rulers using genetic algorithms. Master\u2019s thesis, Computer Science, University College Cork (2003)"},{"key":"9353_CR16","unstructured":"Galinier, P., Jaumard, B., Morales, R., Pesant, G.: A constraint-based approach to the Golomb ruler problem. In: Proceedings of the 3rd International workshop on CPAIOR (2001)"},{"key":"9353_CR17","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company Inc., Massachusetts (1989)"},{"key":"9353_CR18","doi-asserted-by":"crossref","unstructured":"Goldberg, D., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, pp. 69\u201393. Morgan Kaufmann, California (1991)","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"9353_CR19","doi-asserted-by":"crossref","unstructured":"Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: International Conference on Principles and Practice of Constraint Programming, pp. 274\u2013289. Springer (2004)","DOI":"10.1007\/978-3-540-30201-8_22"},{"issue":"1","key":"9353_CR20","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/TCBB.2009.34","volume":"8","author":"M Hoque","year":"2011","unstructured":"Hoque, M., Chetty, M., Lewis, A., Sattar, A.: Twin removal in genetic algorithms for protein structure prediction using low-resolution model. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(1), 234\u2013245 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"9353_CR21","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/18.32165","volume":"3","author":"T Klove","year":"1989","unstructured":"Klove, T.: Bounds and construction for difference triangle sets. IEEE Trans. Inf. Theory 3(4), 879\u2013886 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9353_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07418-3","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1994","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1994). ISBN 3-540-58090-5"},{"key":"9353_CR23","volume-title":"Parallel Local Search in Comet","author":"L Michel","year":"2005","unstructured":"Michel, L., Van Hentenryck, P.: Parallel Local Search in Comet. Springer, Berlin (2005). ISBN 978-3-540-32050-0"},{"key":"9353_CR24","first-page":"645","volume":"6876","author":"M Newton","year":"2011","unstructured":"Newton, M., Pham, D., Sattar, A., Maher, M.: Kangaroo: An efficient constraint-based local search system using lazy propagation. Princ. Pract. Constraint Program. LNCS 6876, 645\u2013659 (2011)","journal-title":"Princ. Pract. Constraint Program. LNCS"},{"key":"9353_CR25","doi-asserted-by":"crossref","unstructured":"Polash, M.M.A., Newton, M.A.H., Sattar, A.: Constraint-based local search for optimal Golomb rulers. In: Michel, L. (ed.) Proceedings of CPAIOR, LNCS, vol. 9075, pp. 322\u2013331. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-18008-3_22"},{"key":"9353_CR26","unstructured":"Prestwich, S.: Trading completeness for scalability: hybrid search for cliques and rulers. In: Proceedings of the 3rd International Workshop on CPAIOR, pp. 159\u2013174 (2001)"},{"key":"9353_CR27","unstructured":"Prestwich, S.: Supersymmetric modeling for local search. In: Proceedings of SymCon02 Workshop on Symmetry and Constraint Satisfaction Problems, pp. 21\u201328 (2002)"},{"key":"9353_CR28","doi-asserted-by":"crossref","unstructured":"Prestwich, S., Roli, A.: Symmetry breaking and local search spaces. In: Bartk, R., Milano, M. (eds.) Proceedings of CPAIOR, LNCS, vol. 3524, pp. 273\u2013287. Springer, Germany (2005)","DOI":"10.1007\/11493853_21"},{"key":"9353_CR29","unstructured":"Rankin, W.: Optimal Golomb rulers: an exhaustive parallel search implementation. Master\u2019s thesis, Duke University Electrical Engineering Dept., Durham, NC, December (1993)"},{"key":"9353_CR30","first-page":"738","volume":"3","author":"J Robbins","year":"1987","unstructured":"Robbins, J., Gagliardi, R., Taylor, H.: Acquisition sequences in PPM communications. IEEE Trans. Inf. Theory 3, 738\u2013744 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9353_CR31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1967.1053951","volume":"1","author":"J Robinson","year":"1967","unstructured":"Robinson, J., Bernstein, A.: A class of binary recurrent codes with limited error propagation. IEEE Trans. Inf. Theory 1, 106\u2013113 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9353_CR32","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/18.50388","volume":"36","author":"J Shearer","year":"1990","unstructured":"Shearer, J.: Some new optimum Golomb rulers. IEEE Trans. Inf. Theory 36(1), 183\u2013184 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9353_CR33","unstructured":"Smith, B.M., Stergiou, K., Walsh, T.: Modelling the Golomb ruler problem. In: Workshop on non-binary constraints (IJCAI) Stockholm, (1999)"},{"key":"9353_CR34","unstructured":"Soliday, S.W., Homaifar, A., Lebby, G.: Genetic algorithm approach to the search for Golomb rulers. In: 6th International Conference on Genetic Algorithms (ICGA\u201995), pp. 528\u2013535. Morgan Kaufmann (1995)"},{"key":"9353_CR35","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2\u20139. Morgan Kaufmann Publishers Inc. (1989)"},{"key":"9353_CR36","volume-title":"Constraint-Based Local Search","author":"P Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2005). ISBN 0262220776"},{"key":"9353_CR37","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Michel, L.: Differentiable invariants. In: Principles and Practice of Constraint Programming-CP, pp. 604\u2013619 (2006)","DOI":"10.1007\/11889205_43"},{"key":"9353_CR38","doi-asserted-by":"crossref","unstructured":"Wetter, J., Akg\u00fcn, \u00d6., Miguel, I.: Automatically generating streamlined constraint models with essence and conjure. In: International Conference on Principles and Practice of Constraint Programming, pp. 480\u2013496. Springer (2015)","DOI":"10.1007\/978-3-319-23219-5_34"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9353-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9353-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9353-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T20:03:11Z","timestamp":1569960191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9353-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,29]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9353"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9353-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,29]]}}}