{"id":"https://openalex.org/W2139168414","doi":"https://doi.org/10.1155/2015/637809","title":"A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems","display_name":"A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2139168414","doi":"https://doi.org/10.1155/2015/637809","mag":"2139168414"},"language":"en","primary_location":{"id":"doi:10.1155/2015/637809","doi":"https://doi.org/10.1155/2015/637809","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2015/637809","pdf_url":"https://downloads.hindawi.com/journals/mpe/2015/637809.pdf","source":{"id":"https://openalex.org/S178238111","display_name":"Mathematical Problems in Engineering","issn_l":"1024-123X","issn":["1024-123X","1026-7077","1563-5147"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","poland-20","vabb-shw"],"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869","https://openalex.org/P4310320595"],"host_organization_lineage_names":["Hindawi Publishing Corporation","Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems in Engineering","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/mpe/2015/637809.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084813055","display_name":"Noureddine Bouhmala","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405282708","display_name":"Buskerud and Vestfold University College","ror":"https://ror.org/00bhc0620","country_code":"NO","type":"education","lineage":["https://openalex.org/I2801380234","https://openalex.org/I4405282708"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"N. Bouhmala","raw_affiliation_strings":["Department of Technology and Maritime Innovation, Buskerud and Vestfold University College, P.O. Box 4, 3199 Borre, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Technology and Maritime Innovation, Buskerud and Vestfold University College, P.O. Box 4, 3199 Borre, Norway","institution_ids":["https://openalex.org/I4405282708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084813055"],"corresponding_institution_ids":["https://openalex.org/I4405282708"],"apc_list":{"value":2550,"currency":"USD","value_usd":2550},"apc_paid":{"value":1799,"currency":"EUR","value_usd":1940},"fwci":2.2921,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90110673,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2015","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/binary-constraint-satisfaction-problems","display_name":"binary constraint satisfaction problems","score":0.9129999876022339},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.9359999895095825},{"id":"https://openalex.org/keywords/greedy-local-search","display_name":"greedy local search","score":0.953000009059906},{"id":"https://openalex.org/keywords/penalty-weights","display_name":"penalty weights","score":0.7850000262260437}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8969242572784424},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6266036033630371},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6143515110015869},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5649710893630981},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.5356673002243042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5320927500724792},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5295867323875427},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5015966892242432},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4914799928665161},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4874308407306671},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4651990830898285},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4562881588935852},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4368327260017395},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4228958487510681},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41864702105522156},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.41259557008743286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.404497355222702},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3860071301460266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3651699125766754},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2668786644935608},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.23671886324882507},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.07197979092597961},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.05896034836769104},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1155/2015/637809","doi":"https://doi.org/10.1155/2015/637809","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2015/637809","pdf_url":"https://downloads.hindawi.com/journals/mpe/2015/637809.pdf","source":{"id":"https://openalex.org/S178238111","display_name":"Mathematical Problems in Engineering","issn_l":"1024-123X","issn":["1024-123X","1026-7077","1563-5147"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","poland-20","vabb-shw"],"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869","https://openalex.org/P4310320595"],"host_organization_lineage_names":["Hindawi Publishing Corporation","Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems in Engineering","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:hin:jnlmpe:637809","doi":null,"is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/MPE/2015/637809.xml","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,"listed_in":[],"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"},{"id":"pmh:oai:doaj.org/article:7a08f0258ae84f54a461f913fde37e30","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/7a08f0258ae84f54a461f913fde37e30","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Problems in Engineering, Vol 2015 (2015)","raw_type":"article"},{"id":"pmh:oai:openarchive.usn.no:11250/2373824","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11250/2373824","pdf_url":null,"source":{"id":"https://openalex.org/S7407064446","display_name":"NORA - Norwegian Open Research Archives","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1155/2015/637809","doi":"https://doi.org/10.1155/2015/637809","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2015/637809","pdf_url":"https://downloads.hindawi.com/journals/mpe/2015/637809.pdf","source":{"id":"https://openalex.org/S178238111","display_name":"Mathematical Problems in Engineering","issn_l":"1024-123X","issn":["1024-123X","1026-7077","1563-5147"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","poland-20","vabb-shw"],"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869","https://openalex.org/P4310320595"],"host_organization_lineage_names":["Hindawi Publishing Corporation","Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Problems in Engineering","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2139168414.pdf","grobid_xml":"https://content.openalex.org/works/W2139168414.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W13289598","https://openalex.org/W49630862","https://openalex.org/W63621395","https://openalex.org/W77793587","https://openalex.org/W137179583","https://openalex.org/W1494541609","https://openalex.org/W1519526968","https://openalex.org/W1519828364","https://openalex.org/W1526749820","https://openalex.org/W1528015358","https://openalex.org/W1536418390","https://openalex.org/W1590139639","https://openalex.org/W1591532012","https://openalex.org/W1605876683","https://openalex.org/W1663815463","https://openalex.org/W1680219918","https://openalex.org/W1792365433","https://openalex.org/W1847544347","https://openalex.org/W1967688945","https://openalex.org/W1990734013","https://openalex.org/W1999038767","https://openalex.org/W2013493090","https://openalex.org/W2021700650","https://openalex.org/W2034530760","https://openalex.org/W2036792519","https://openalex.org/W2042986967","https://openalex.org/W2054144393","https://openalex.org/W2056981390","https://openalex.org/W2065046581","https://openalex.org/W2095435811","https://openalex.org/W2114224867","https://openalex.org/W2121766240","https://openalex.org/W2135432705","https://openalex.org/W2137573754","https://openalex.org/W2139300273","https://openalex.org/W2145598935","https://openalex.org/W2158301224","https://openalex.org/W2161455936","https://openalex.org/W2404085562","https://openalex.org/W2529918221","https://openalex.org/W2605289564","https://openalex.org/W2610837804","https://openalex.org/W2741261446","https://openalex.org/W2965147997","https://openalex.org/W3102502824"],"related_works":["https://openalex.org/W7095187038","https://openalex.org/W2168360728","https://openalex.org/W2143629183","https://openalex.org/W1485782686","https://openalex.org/W7097441298","https://openalex.org/W2740554437","https://openalex.org/W178949650","https://openalex.org/W7074565694","https://openalex.org/W7099816904","https://openalex.org/W12847816"],"abstract_inverted_index":{"The":[0,33,101,124],"constraint":[1,30,56,108],"satisfaction":[2,31,109],"problem":[3],"(CSP)":[4],"is":[5,85,103,131,154,175],"a":[6,12,24,39,45,50,118,141],"popular":[7],"used":[8],"paradigm":[9],"to":[10,99,172],"model":[11],"wide":[13],"spectrum":[14],"of":[15,97,117,133,178],"optimization":[16],"problems":[17,110,137],"in":[18,63,82,185],"artificial":[19],"intelligence.":[20],"This":[21],"paper":[22],"presents":[23],"fast":[25],"metaheuristic":[26,43,78,130,153],"for":[27,143],"solving":[28,134],"binary":[29],"problems.":[32],"method":[34],"can":[35],"be":[36],"classified":[37],"as":[38],"variable":[40],"depth":[41],"search":[42,48],"combining":[44],"greedy":[46],"local":[47],"using":[49,66],"self-adaptive":[51],"weighting":[52],"strategy":[53],"on":[54,71,105,163],"the":[55,64,72,76,83,86,128,151,176],"weights.":[57],"Several":[58],"metaheuristics":[59,174],"have":[60],"been":[61],"developed":[62,81],"past":[65,84],"various":[67],"penalty":[68],"weight":[69],"mechanisms":[70],"constraints.":[73],"What":[74],"distinguishes":[75],"proposed":[77,129,152],"from":[79,94],"those":[80],"update":[87],"ofkvariables":[88],"during":[89],"each":[90],"iteration":[91],"when":[92,161],"moving":[93],"one":[95],"assignment":[96],"values":[98],"another.":[100],"benchmark":[102],"based":[104],"hard":[106,135],"random":[107],"enjoying":[111],"several":[112],"features":[113],"that":[114,127,138],"make":[115],"them":[116],"great":[119],"theoretical":[120],"and":[121,146],"practical":[122,186],"interest.":[123],"results":[125],"show":[126],"capable":[132],"unsolved":[136],"still":[139],"remain":[140],"challenge":[142],"both":[144],"complete":[145],"incomplete":[147],"methods.":[148],"In":[149],"addition,":[150],"remarkably":[155],"faster":[156],"than":[157],"all":[158],"existing":[159],"solvers":[160],"tested":[162],"previously":[164],"solved":[165],"instances.":[166],"Finally,":[167],"its":[168],"distinctive":[169],"feature":[170],"contrary":[171],"other":[173],"absence":[177],"parameter":[179],"tuning":[180],"making":[181],"it":[182],"highly":[183],"suitable":[184],"scenarios.":[187]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}