{"id":"https://openalex.org/W2964774152","doi":"https://doi.org/10.24963/ijcai.2019/160","title":"Optimizing Constraint Solving via Dynamic Programming","display_name":"Optimizing Constraint Solving via Dynamic Programming","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2964774152","doi":"https://doi.org/10.24963/ijcai.2019/160","mag":"2964774152"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/160","doi":"https://doi.org/10.24963/ijcai.2019/160","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/160","pdf_url":"https://www.ijcai.org/proceedings/2019/0160.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.ijcai.org/proceedings/2019/0160.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Shu Lin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shu Lin","raw_affiliation_strings":["Department of Computer Science and Technology, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070152860","display_name":"Na Meng","orcid":"https://orcid.org/0000-0002-0230-5524","observed_orcids":["https://orcid.org/0000-0002-0230-5524"]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Na Meng","raw_affiliation_strings":["Department of Computer Science, Virginia Tech, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100397214","display_name":"Wenxin Li","orcid":"https://orcid.org/0009-0001-6576-1375","observed_orcids":["https://orcid.org/0009-0001-6576-1375","https://orcid.org/0000-0003-1744-7792"]},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenxin Li","raw_affiliation_strings":["Department of Computer Science and Technology, Peking University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":0.3252,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.56742345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1146","last_page":"1154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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":9.999999747378752e-05,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-optimization","display_name":"constraint optimization","score":0.9319999814033508},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8560000061988831},{"id":"https://openalex.org/keywords/finite-domain-constraints","display_name":"finite domain constraints","score":0.5860000252723694},{"id":"https://openalex.org/keywords/minizinc","display_name":"MiniZinc","score":0.8240000009536743},{"id":"https://openalex.org/keywords/gecode","display_name":"Gecode","score":0.8989999890327454},{"id":"https://openalex.org/keywords/search-space-pruning","display_name":"search space pruning","score":0.718999981880188},{"id":"https://openalex.org/keywords/0-1-knapsack-problem","display_name":"0-1 knapsack problem","score":0.8510000109672546}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7649252414703369},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7422487735748291},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6685318350791931},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.6545340418815613},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6531170010566711},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6138072609901428},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5844217538833618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5707168579101562},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.47265803813934326},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4696599245071411},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4654204547405243},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4149884581565857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33752119541168213},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09533330798149109},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08047434687614441},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2019/160","doi":"https://doi.org/10.24963/ijcai.2019/160","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/160","pdf_url":"https://www.ijcai.org/proceedings/2019/0160.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/160","doi":"https://doi.org/10.24963/ijcai.2019/160","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/160","pdf_url":"https://www.ijcai.org/proceedings/2019/0160.pdf","source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G6896362766","display_name":null,"funder_award_id":"91646202","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2964774152.pdf","grobid_xml":"https://content.openalex.org/works/W2964774152.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W161749416","https://openalex.org/W198893173","https://openalex.org/W1547410739","https://openalex.org/W1584243346","https://openalex.org/W1692778824","https://openalex.org/W2059035667","https://openalex.org/W2095067556","https://openalex.org/W2096306683","https://openalex.org/W2098432798","https://openalex.org/W2151814155","https://openalex.org/W2159875930","https://openalex.org/W2400555644","https://openalex.org/W2623418526","https://openalex.org/W2900096425","https://openalex.org/W2903545960","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W7207871897","https://openalex.org/W3196233277","https://openalex.org/W7206178445","https://openalex.org/W7163883124","https://openalex.org/W2140929402","https://openalex.org/W2060184368","https://openalex.org/W2952237808","https://openalex.org/W2903545960","https://openalex.org/W1878118188","https://openalex.org/W4382866853"],"abstract_inverted_index":{"Constraint":[0],"optimization":[1,71],"problems":[2,13,72],"(COP)":[3],"on":[4],"finite":[5],"domains":[6],"are":[7],"typically":[8],"solved":[9],"via":[10],"search.":[11],"Many":[12],"(e.g.,":[14],"0-1":[15],"knapsack)":[16],"involve":[17],"redundant":[18],"search,":[19],"making":[20],"a":[21,57,75,109],"general":[22],"constraint":[23,50,70,122,137],"solver":[24],"revisit":[25],"the":[26,46,83,88,99,106,115,124,134],"same":[27],"subproblems":[28],"again":[29],"and":[30,101],"again.":[31],"Existing":[32],"approaches":[33],"use":[34],"caching,":[35],"symmetry":[36],"breaking,":[37],"subproblem":[38],"dominance,":[39],"or":[40],"search":[41,47],"with":[42,78,93],"decomposition":[43],"to":[44,64,85,104,118],"prune":[45],"space":[48],"of":[49,69,136],"problems.":[51],"In":[52],"this":[53],"paper":[54],"we":[55],"present":[56],"different":[58],"approach--DPSolver--which":[59],"uses":[60],"dynamic":[61],"programming":[62],"(DP)":[63],"efficiently":[65,91],"solve":[66],"certain":[67],"types":[68],"(COPs).":[73],"Given":[74],"COP":[76],"modeled":[77],"MiniZinc,":[79],"DPSolver":[80,97,113,131],"first":[81],"analyzes":[82],"model":[84,105,117],"decide":[86],"whether":[87],"problem":[89,107],"is":[90],"solvable":[92],"DP.":[94],"If":[95],"so,":[96],"refactors":[98],"constraints":[100],"objective":[102],"functions":[103],"as":[108],"DP":[110],"problem.":[111],"Finally,":[112],"feeds":[114],"refactored":[116],"Gecode--a":[119],"widely":[120],"used":[121],"solver--for":[123],"optimal":[125],"solution.":[126],"Our":[127],"evaluation":[128],"shows":[129],"that":[130],"significantly":[132],"improves":[133],"performance":[135],"solving.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-08-13T00:00:00"}