发布求助
文献互助 智能选刊 最新文献

Constraints最新文献

筛选
英文 中文
Global domain views for expressive and cross-domain constraint programming 用于表达性和跨域约束规划的全局域视图
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-11 DOI: 10.1007/s10601-021-09324-7
Dimitri Justeau‐Allaire, Charles Prud’homme
{"title":"Global domain views for expressive and cross-domain constraint programming","authors":"Dimitri Justeau‐Allaire, Charles Prud’homme","doi":"10.1007/s10601-021-09324-7","DOIUrl":"https://doi.org/10.1007/s10601-021-09324-7","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"27 1","pages":"1 - 7"},"PeriodicalIF":1.6,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46003267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Super-reparametrizations of weighted CSPs: properties and optimization perspective 加权CSP的超重参数化：性质和优化视角
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-06 DOI: 10.1007/s10601-023-09343-6
Tomáš Dlask, Tomáš Werner, S. de Givry
{"title":"Super-reparametrizations of weighted CSPs: properties and optimization perspective","authors":"Tomáš Dlask, Tomáš Werner, S. de Givry","doi":"10.1007/s10601-023-09343-6","DOIUrl":"https://doi.org/10.1007/s10601-023-09343-6","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"277 - 319"},"PeriodicalIF":1.6,"publicationDate":"2022-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48168775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Variable ordering for decision diagrams: A portfolio approach 决策图的可变排序:投资组合方法
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-04 DOI: 10.1007/s10601-021-09325-6
Anthony Karahalios, Willem-Jan van Hoeve
{"title":"Variable ordering for decision diagrams: A portfolio approach","authors":"Anthony Karahalios, Willem-Jan van Hoeve","doi":"10.1007/s10601-021-09325-6","DOIUrl":"https://doi.org/10.1007/s10601-021-09325-6","url":null,"abstract":"<p>Relaxed decision diagrams have been successfully applied to solve combinatorial optimization problems, but their performance is known to strongly depend on the variable ordering. We propose a portfolio approach to selecting the best ordering among a set of alternatives. We consider several different portfolio mechanisms: a static uniform time-sharing portfolio, an offline predictive model of the single best algorithm using classifiers, a low-knowledge algorithm selection, and a dynamic online time allocator. As a case study, we compare and contrast their performance on the graph coloring problem. We find that on this problem domain, the dynamic online time allocator provides the best overall performance.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"24 2","pages":""},"PeriodicalIF":1.6,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Fast and parallel decomposition of constraint satisfaction problems. 约束满足问题的快速并行分解。
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-01 Epub Date: 2022-06-03 DOI: 10.1007/s10601-022-09332-1
Georg Gottlob, Cem Okulmus, Reinhard Pichler
{"title":"Fast and parallel decomposition of constraint satisfaction problems.","authors":"Georg Gottlob,&nbsp;Cem Okulmus,&nbsp;Reinhard Pichler","doi":"10.1007/s10601-022-09332-1","DOIUrl":"https://doi.org/10.1007/s10601-022-09332-1","url":null,"abstract":"<p><p>Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful decomposition methods have been developed to overcome this complexity. However, this poses the challenge of actually computing such a decomposition for a given CSP instance, and previous algorithms have shown their limitations in doing so. In this paper, we present a number of key algorithmic improvements and parallelisation techniques to compute so-called Generalized Hypertree Decompositions (GHDs) faster. We thus advance the ability to compute optimal (i.e., minimal-width) GHDs for a significantly wider range of CSP instances on modern machines. This lays the foundation for more systems and applications in evaluating CSPs and related problems (such as Conjunctive Query answering) based on their structural properties.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"27 3","pages":"284-326"},"PeriodicalIF":1.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360169/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40697358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. 具有循环偏好的三维稳定匹配问题的约束规划模型集合。
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-01 Epub Date: 2022-06-01 DOI: 10.1007/s10601-022-09335-y
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
{"title":"A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences.","authors":"Ágnes Cseh,&nbsp;Guillaume Escamocher,&nbsp;Begüm Genç,&nbsp;Luis Quesada","doi":"10.1007/s10601-022-09335-y","DOIUrl":"https://doi.org/10.1007/s10601-022-09335-y","url":null,"abstract":"<p><p>We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of the two-dimensional stable matching problem, we are the first to present constraint models for a higher number of dimensions. We show for all five models how to capture two different stability notions, namely weak and strong stability. Additionally, we translate some well-known fairness notions (i.e. sex-equal, minimum regret, egalitarian) into 3-dimensional matchings, and present how to capture them in each model. Our tests cover dozens of problem sizes and four different instance generation methods. We explore two levels of commitment in our models: one where we have an individual variable for each agent (individual commitment), and another one where the determination of a variable involves pairing the three agents at once (group commitment). Our experiments show that the suitability of the commitment depends on the type of stability we are dealing with, and that the choice of the search heuristic can help improve performance. Our experiments not only brought light to the role that learning and restarts can play in solving this kind of problems, but also allowed us to discover that in some cases combining strong and weak stability leads to reduced runtimes for the latter.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"27 3","pages":"249-283"},"PeriodicalIF":1.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9360097/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40696453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Generative magic and designing magic performances with constraint programming 生成魔术与约束规划的魔术表演设计
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-01-01 DOI: 10.1007/s10601-022-09334-z
Guilherme de Azevedo Silveira
{"title":"Generative magic and designing magic performances with constraint programming","authors":"Guilherme de Azevedo Silveira","doi":"10.1007/s10601-022-09334-z","DOIUrl":"https://doi.org/10.1007/s10601-022-09334-z","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"27 1","pages":"168-191"},"PeriodicalIF":1.6,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52195971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An algorithm-independent measure of progress for linear constraint propagation 线性约束传播的一种与算法无关的进度度量
IF 1.6 4区 计算机科学
Constraints Pub Date : 2021-06-14 DOI: 10.1007/s10601-022-09338-9
Boro Sofranac, A. Gleixner, S. Pokutta
{"title":"An algorithm-independent measure of progress for linear constraint propagation","authors":"Boro Sofranac, A. Gleixner, S. Pokutta","doi":"10.1007/s10601-022-09338-9","DOIUrl":"https://doi.org/10.1007/s10601-022-09338-9","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"27 1","pages":"432 - 455"},"PeriodicalIF":1.6,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47932735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to: The potential of quantum annealing for rapid solution structure identification 修正:量子退火在快速溶液结构识别中的潜力
IF 1.6 4区 计算机科学
Constraints Pub Date : 2021-04-12 DOI: 10.1007/s10601-021-09320-x
Yuchen Pang, Carleton Coffrin, A. Lokhov, Marc Vuffray
{"title":"Correction to: The potential of quantum annealing for rapid solution structure identification","authors":"Yuchen Pang, Carleton Coffrin, A. Lokhov, Marc Vuffray","doi":"10.1007/s10601-021-09320-x","DOIUrl":"https://doi.org/10.1007/s10601-021-09320-x","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"26 1","pages":"107 - 107"},"PeriodicalIF":1.6,"publicationDate":"2021-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10601-021-09320-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47070002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The algebraic structure of the densification and the sparsification tasks for CSPs csp的密化和稀疏化任务的代数结构
IF 1.6 4区 计算机科学
Constraints Pub Date : 2021-04-11 DOI: 10.1007/s10601-022-09340-1
Rustem Takhanov
{"title":"The algebraic structure of the densification and the sparsification tasks for CSPs","authors":"Rustem Takhanov","doi":"10.1007/s10601-022-09340-1","DOIUrl":"https://doi.org/10.1007/s10601-022-09340-1","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"14 1","pages":"13 - 44"},"PeriodicalIF":1.6,"publicationDate":"2021-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52195979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search 学会放松:整合0-1整数线性规划与伪布尔冲突驱动搜索
IF 1.6 4区 计算机科学
Constraints Pub Date : 2021-01-18 DOI: 10.1007/s10601-020-09318-x
Jo Devriendt, Ambros Gleixner, Jakob Nordström
{"title":"Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search","authors":"Jo Devriendt, Ambros Gleixner, Jakob Nordström","doi":"10.1007/s10601-020-09318-x","DOIUrl":"https://doi.org/10.1007/s10601-020-09318-x","url":null,"abstract":"<p>Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometimes get hopelessly stuck even when the linear programming (LP) relaxation is infeasible over the reals. Inspired by mixed integer programming (MIP), we address this problem by interleaving incremental LP solving with cut generation within the conflict-driven pseudo-Boolean search. This hybrid approach, which for the first time combines MIP techniques with full-blown conflict analysis operating directly on linear inequalities using the cutting planes method, significantly improves performance on a wide range of benchmarks, approaching a “best-of-both-worlds” scenario between SAT-style conflict-driven search and MIP-style branch-and-cut.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"25 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信