{"id":"https://openalex.org/W2741169279","doi":"https://doi.org/10.1007/s10732-017-9353-x","title":"Constraint-based search for optimal Golomb rulers","display_name":"Constraint-based search for optimal Golomb rulers","publication_year":2017,"publication_date":"2017-07-29","ids":{"openalex":"https://openalex.org/W2741169279","doi":"https://doi.org/10.1007/s10732-017-9353-x","mag":"2741169279"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-017-9353-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-017-9353-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-017-9353-x.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s10732-017-9353-x.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071233592","display_name":"Md Masbaul Alam Polash","orcid":"https://orcid.org/0000-0001-8922-7938"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"M. M. A. Polash","raw_affiliation_strings":["Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia","institution_ids":["https://openalex.org/I11701301"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086354302","display_name":"M. A. Hakim Newton","orcid":"https://orcid.org/0000-0001-5655-0683"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"M. A. H. Newton","raw_affiliation_strings":["Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia","institution_ids":["https://openalex.org/I11701301"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038675407","display_name":"Abdul Sattar","orcid":"https://orcid.org/0000-0002-2567-2052"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A. Sattar","raw_affiliation_strings":["Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"Institute for Integrated and Intelligent Systems, Griffith University, Nathan, Australia","institution_ids":["https://openalex.org/I11701301"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071233592"],"corresponding_institution_ids":["https://openalex.org/I11701301"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.3921,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.70931923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"6","first_page":"501","last_page":"532"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9520000219345093,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9520000219345093,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.95169997215271,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.940500020980835,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/golomb-coding","display_name":"Golomb coding","score":0.8763760924339294},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5207452774047852},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.47759413719177246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46324363350868225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4632369875907898},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.448533833026886},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4285745918750763},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41914960741996765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41676095128059387},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33143728971481323},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17796233296394348}],"concepts":[{"id":"https://openalex.org/C66656319","wikidata":"https://www.wikidata.org/wiki/Q2638","display_name":"Golomb coding","level":5,"score":0.8763760924339294},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5207452774047852},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.47759413719177246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46324363350868225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4632369875907898},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.448533833026886},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4285745918750763},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41914960741996765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41676095128059387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33143728971481323},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17796233296394348},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.0},{"id":"https://openalex.org/C13481523","wikidata":"https://www.wikidata.org/wiki/Q412438","display_name":"Image compression","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10732-017-9353-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-017-9353-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-017-9353-x.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},{"id":"pmh:oai:research-repository.griffith.edu.au:10072/352719","is_oa":true,"landing_page_url":"http://hdl.handle.net/10072/352719","pdf_url":"http://hdl.handle.net/10072/352719","source":null,"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal article"},{"id":"pmh:oai:RePEc:spr:joheur:v:23:y:2017:i:6:d:10.1007_s10732-017-9353-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10732-017-9353-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10732-017-9353-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10732-017-9353-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10732-017-9353-x.pdf","source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2741169279.pdf","grobid_xml":"https://content.openalex.org/works/W2741169279.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W30464726","https://openalex.org/W1482701010","https://openalex.org/W1505529854","https://openalex.org/W1518669688","https://openalex.org/W1521204508","https://openalex.org/W1568834902","https://openalex.org/W1591532012","https://openalex.org/W2019034008","https://openalex.org/W2038777942","https://openalex.org/W2062525218","https://openalex.org/W2063976867","https://openalex.org/W2079858556","https://openalex.org/W2106371135","https://openalex.org/W2107186564","https://openalex.org/W2129469300","https://openalex.org/W2142183404","https://openalex.org/W2148948564","https://openalex.org/W2149807493","https://openalex.org/W2150101360","https://openalex.org/W2150748533","https://openalex.org/W2156728410","https://openalex.org/W2165083003","https://openalex.org/W2166634136","https://openalex.org/W2170193181","https://openalex.org/W2294294027","https://openalex.org/W2324447404","https://openalex.org/W2406448703","https://openalex.org/W2912436028","https://openalex.org/W3023540311","https://openalex.org/W4229620790","https://openalex.org/W4285719527","https://openalex.org/W4293662999","https://openalex.org/W4300005723","https://openalex.org/W4300886904"],"related_works":["https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W2494989913","https://openalex.org/W3022707108","https://openalex.org/W1605808593","https://openalex.org/W4210317843","https://openalex.org/W2181360821","https://openalex.org/W2378762226","https://openalex.org/W2146653473","https://openalex.org/W2368709543"],"abstract_inverted_index":{"Finding":[0],"optimal":[1,30,59,86,142,171],"Golomb":[2,21,31,37,60,87,108,143,172],"rulers":[3,38,88,144,173],"is":[4,17],"an":[5,29,151,155],"extremely":[6],"challenging":[7],"combinatorial":[8],"problem.":[9],"The":[10,56],"distance":[11],"between":[12],"each":[13],"pair":[14],"of":[15,27,67,89,145,174],"mark":[16],"unique":[18],"in":[19,41],"a":[20,24,65,130,138],"ruler.":[22],"For":[23],"given":[25],"number":[26],"marks,":[28],"ruler":[32,61,109],"has":[33],"the":[34,160,163,180],"minimum":[35],"length.":[36,147],"are":[39],"used":[40],"application":[42],"areas":[43],"such":[44,69],"as":[45,70],"X-ray":[46],"crystallography,":[47],"radio":[48],"astronomy,":[49],"information":[50],"theory,":[51],"and":[52,81,84,111,123],"pulse":[53],"phase":[54],"modulation.":[55],"most":[57],"recent":[58],"search":[62,134,140,157,165,169,182],"algorithm":[63,135,152],"hybridises":[64],"range":[66],"techniques":[68],"greedy":[71],"randomised":[72],"adaptive":[73],"search,":[74,76,78],"scatter":[75],"tabu":[77,122],"clustering":[79],"techniques,":[80],"constraint":[82],"programming,":[83],"obtains":[85],"up":[90,175,184],"to":[91,136,153,176,185],"16":[92],"marks":[93,110,178],"with":[94,121],"very":[95],"low":[96],"success":[97],"rates.":[98],"In":[99],"this":[100],"paper,":[101],"we":[102,127],"provide":[103],"tight":[104],"upper":[105],"bounds":[106],"for":[107,141],"present":[112,150],"heuristic-based":[113],"effective":[114],"domain":[115],"reduction":[116],"techniques.":[117],"Using":[118],"these":[119],"along":[120],"configuration":[124],"checking":[125],"meta-heuristics,":[126],"then":[128,149],"develop":[129],"constraint-based":[131],"multi-point":[132],"local":[133],"perform":[137,154],"satisfaction":[139,164,168],"specified":[146],"We":[148],"optimisation":[156,181],"that":[158],"minimises":[159],"length":[161],"using":[162],"repeatedly.":[166],"Our":[167],"finds":[170,183],"19":[177],"while":[179],"17":[186],"marks.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}