{"id":"https://openalex.org/W1970707123","doi":"https://doi.org/10.1145/1066677.1066769","title":"Solving strategies using a hybridization model for local search and constraint propagation","display_name":"Solving strategies using a hybridization model for local search and constraint propagation","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W1970707123","doi":"https://doi.org/10.1145/1066677.1066769","mag":"1970707123"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066769","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038797051","display_name":"Tony Lambert","orcid":null},"institutions":[{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tony Lambert","raw_affiliation_strings":["Universit\u00e9 de Nantes, France","Universite de Nantes, France;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Nantes, France","institution_ids":["https://openalex.org/I97188460"]},{"raw_affiliation_string":"Universite de Nantes, France;","institution_ids":["https://openalex.org/I97188460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027575859","display_name":"\u00c9ric Monfroy","orcid":"https://orcid.org/0000-0001-7970-1368"},"institutions":[{"id":"https://openalex.org/I75778554","display_name":"Federico Santa Mar\u00eda Technical University","ror":"https://ror.org/05510vn56","country_code":"CL","type":"education","lineage":["https://openalex.org/I75778554"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Eric Monfroy","raw_affiliation_strings":["Universidad T\u00e9cnica Federico, Valpara\u00edso, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad T\u00e9cnica Federico, Valpara\u00edso, Chile","institution_ids":["https://openalex.org/I75778554"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110660182","display_name":"Fr\u00e9d\u00e9ric Saubion","orcid":"https://orcid.org/0000-0001-8227-7174"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Saubion","raw_affiliation_strings":["LERIA, Universit\u00e9 de Angers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LERIA, Universit\u00e9 de Angers, France","institution_ids":["https://openalex.org/I49451733"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7847,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71907639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"398","last_page":"403"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7078617811203003},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.643794596195221},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.6264248490333557},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5750753879547119},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.571074366569519},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5416591167449951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5376667976379395},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5265044569969177},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.517479658126831},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48892942070961},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48802319169044495},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.41782718896865845},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35457512736320496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34473466873168945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.325161337852478},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24257639050483704}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7078617811203003},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.643794596195221},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.6264248490333557},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5750753879547119},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.571074366569519},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5416591167449951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5376667976379395},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5265044569969177},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.517479658126831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48892942070961},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48802319169044495},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.41782718896865845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35457512736320496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34473466873168945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.325161337852478},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24257639050483704},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066677.1066769","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1486850233","https://openalex.org/W1523091792","https://openalex.org/W1554727768","https://openalex.org/W1556356866","https://openalex.org/W1573856812","https://openalex.org/W1605810992","https://openalex.org/W1606316903","https://openalex.org/W1733489975","https://openalex.org/W2095435811","https://openalex.org/W2106371135","https://openalex.org/W2339500526","https://openalex.org/W2586568713","https://openalex.org/W4300005723","https://openalex.org/W6631549624","https://openalex.org/W6675709134"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W2049055139","https://openalex.org/W2140769824","https://openalex.org/W2569549435","https://openalex.org/W115413730","https://openalex.org/W2148600103","https://openalex.org/W2091348864","https://openalex.org/W2524435840","https://openalex.org/W2032348095"],"abstract_inverted_index":{"Hybridization":[0],"of":[1,19,25,46,63,66,77],"local":[2,47],"search":[3,48],"and":[4,49],"constraint":[5,50],"programming":[6],"techniques":[7],"for":[8,22,44],"solving":[9],"Constraint":[10],"Satisfaction":[11],"Problems":[12],"is":[13],"generally":[14],"restricted":[15],"to":[16,80],"some":[17,67],"kind":[18],"master-slave":[20],"combinations":[21],"specific":[23,68],"classes":[24],"problems.":[26],"In":[27,52],"this":[28,53],"paper":[29],"we":[30],"study":[31],"combination":[32],"strategies":[33],"at":[34],"a":[35,41,64],"finer":[36],"hybridization":[37,45],"grain,":[38],"based":[39],"on":[40],"theoretical":[42],"model":[43,79],"propagation.":[51],"framework,":[54],"hybrid":[55],"resolution":[56],"can":[57],"be":[58],"achieved":[59],"as":[60],"the":[61,75,78],"computation":[62],"fixpoint":[65],"reduction":[69],"functions.":[70],"Some":[71],"experimental":[72],"results":[73],"show":[74],"interest":[76],"design":[81],"such":[82],"hybridizations.":[83]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}