{"id":"https://openalex.org/W6928995615","doi":"https://doi.org/10.4230/lipics.cp.2022.32","title":"A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems","display_name":"A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6928995615","doi":"https://doi.org/10.4230/lipics.cp.2022.32"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16661","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.32","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.32","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li, Hongbo","orcid":"https://orcid.org/0000-0002-2664-4117"},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Li, Hongbo","raw_affiliation_strings":["School of Information Science and Technology, Northeast Normal University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Northeast Normal University, Changchun, China","institution_ids":["https://openalex.org/I184983240"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wu, Yaling","orcid":null},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wu, Yaling","raw_affiliation_strings":["School of Information Science and Technology, Northeast Normal University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Northeast Normal University, Changchun, China","institution_ids":["https://openalex.org/I184983240"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yin, Minghao","orcid":null},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yin, Minghao","raw_affiliation_strings":["School of Information Science and Technology, Northeast Normal University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Northeast Normal University, Changchun, China","institution_ids":["https://openalex.org/I184983240"]}]},{"author_position":"last","author":{"id":null,"display_name":"Li, Zhanshan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134929","display_name":"Jilin Province Science and Technology Department","ror":"https://ror.org/049x38272","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210134929"]},{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Zhanshan","raw_affiliation_strings":["College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210134929","https://openalex.org/I194450716"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I184983240"],"apc_list":null,"apc_paid":null,"fwci":0.2763,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59668026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9077000021934509,"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.9077000021934509,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.02449999935925007,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.019700000062584877,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.8790000081062317},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6140999794006348},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.597000002861023},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5213000178337097},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.46470001339912415},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.46369999647140503},{"id":"https://openalex.org/keywords/look-ahead","display_name":"Look-ahead","score":0.44670000672340393},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.39410001039505005}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8790000081062317},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6140999794006348},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5972999930381775},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.597000002861023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5476999878883362},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5213000178337097},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.46369999647140503},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.44670000672340393},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.39410001039505005},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.38199999928474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3765999972820282},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3736000061035156},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3671000003814697},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.3280999958515167},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3000999987125397},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2992999851703644},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.25760000944137573}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:16661","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.32","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.cp.2022.32","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2022.32","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16661","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.32","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Variable":[0],"ordering":[1],"heuristics":[2],"(VOH)":[3],"play":[4],"a":[5,53,58,86],"central":[6],"role":[7],"in":[8,22,113],"solving":[9,23,40],"Constraint":[10],"Satisfaction":[11],"Problems":[12],"(CSP).":[13],"The":[14,44,49,66,121,136,160],"performance":[15],"of":[16,72,89,101,155],"different":[17,41,64,147],"VOHs":[18,38,75,148,185],"may":[19],"vary":[20],"greatly":[21],"the":[24,73,82,92,98,102,110,114,119,125,134,141,153,156,164,168,183],"same":[25],"CSP":[26,42,83,93,204],"instance.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"propose":[32],"an":[33,187,197],"approach":[34,45,166],"to":[35,69,76,80,128,132],"select":[36],"efficient":[37],"for":[39,106,171,202],"instances.":[43],"contains":[46],"two":[47],"phases.":[48],"first":[50],"phase":[51,123],"is":[52,94,104],"probing":[54],"procedure":[55],"that":[56,163],"runs":[57],"simple":[59],"portfolio":[60,67],"strategy":[61,201],"containing":[62],"several":[63],"VOHs.":[65],"tries":[68],"use":[70],"each":[71],"candidate":[74,184],"guide":[77,129],"backtracking":[78,130],"search":[79,115,131,200],"solve":[81,133],"instance":[84],"within":[85],"limited":[87],"number":[88],"failures.":[90],"If":[91],"not":[95],"solved":[96],"by":[97,108,118],"portfolio,":[99],"one":[100],"candidates":[103],"selected":[105,126],"it":[107,177],"analysing":[109],"information":[111],"attached":[112],"trees":[116],"generated":[117],"candidates.":[120],"second":[122],"uses":[124],"VOH":[127,170,189],"CSP.":[135],"experiments":[137],"are":[138,150,158],"run":[139],"with":[140],"MiniZinc":[142],"benchmark":[143],"suite":[144],"and":[145,176,186],"four":[146],"which":[149],"considered":[151],"as":[152],"state":[154],"art":[157],"involved.":[159],"results":[161],"show":[162],"proposed":[165],"finds":[167],"best":[169],"more":[172,179],"than":[173,181],"67%":[174],"instances":[175,180],"solves":[178],"all":[182],"adaptive":[188,199],"based":[190],"on":[191],"Multi-Armed":[192],"Bandit.":[193],"It":[194],"could":[195],"be":[196],"effective":[198],"black-box":[203],"solvers.":[205]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}