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

Constraints最新文献

筛选
英文 中文
Human-centred feasibility restoration in practice 实践中以人为本的可行性修复
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09344-5
Ilankaikone Senthooran, Matthias Klapperstück, G. Belov, T. Czauderna, Kevin Leo, M. Wallace, Michael Wybrow, M. Garcia de la Banda
{"title":"Human-centred feasibility restoration in practice","authors":"Ilankaikone Senthooran, Matthias Klapperstück, G. Belov, T. Czauderna, Kevin Leo, M. Wallace, Michael Wybrow, M. Garcia de la Banda","doi":"10.1007/s10601-023-09344-5","DOIUrl":"https://doi.org/10.1007/s10601-023-09344-5","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"203 - 243"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43212997","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
Exact methods for the Oven Scheduling Problem 烘箱调度问题的精确方法
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09347-2
Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter
{"title":"Exact methods for the Oven Scheduling Problem","authors":"Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter","doi":"10.1007/s10601-023-09347-2","DOIUrl":"https://doi.org/10.1007/s10601-023-09347-2","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"320 - 361"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44401709","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
A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot 双臂多工具装配机器人调度与工作空间布局设计的约束规划模型
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09345-4
Johan Wessén, M. Carlsson, Christian Schulte, P. Flener, F. Pecora, M. Matskin
{"title":"A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot","authors":"Johan Wessén, M. Carlsson, Christian Schulte, P. Flener, F. Pecora, M. Matskin","doi":"10.1007/s10601-023-09345-4","DOIUrl":"https://doi.org/10.1007/s10601-023-09345-4","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"71 - 104"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45036925","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
Block-coordinate descent and local consistencies in linear programming 线性规划中的块坐标下降与局部一致性
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09350-7
Tomáš Dlask
{"title":"Block-coordinate descent and local consistencies in linear programming","authors":"Tomáš Dlask","doi":"10.1007/s10601-023-09350-7","DOIUrl":"https://doi.org/10.1007/s10601-023-09350-7","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"69 - 70"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43305033","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
Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs 线性不等式系统中的活动传播及其与线性规划中块坐标下降的关系
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09349-0
Tomáš Dlask, Tomáš Werner
{"title":"Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs","authors":"Tomáš Dlask, Tomáš Werner","doi":"10.1007/s10601-023-09349-0","DOIUrl":"https://doi.org/10.1007/s10601-023-09349-0","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"244 - 276"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46344386","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
SAT-based optimal classification trees for non-binary data 基于sat的非二值数据最优分类树
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09348-1
Pouya Shati, Eldan Cohen, Sheila A. McIlraith
{"title":"SAT-based optimal classification trees for non-binary data","authors":"Pouya Shati, Eldan Cohen, Sheila A. McIlraith","doi":"10.1007/s10601-023-09348-1","DOIUrl":"https://doi.org/10.1007/s10601-023-09348-1","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"166 - 202"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41943639","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
Hybrid optimization of vehicle routing problems 车辆路径问题的混合优化
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-06-01 DOI: 10.1007/s10601-023-09352-5
Edward Lam
{"title":"Hybrid optimization of vehicle routing problems","authors":"Edward Lam","doi":"10.1007/s10601-023-09352-5","DOIUrl":"https://doi.org/10.1007/s10601-023-09352-5","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"67 - 68"},"PeriodicalIF":1.6,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47484149","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
An interdisciplinary experimental evaluation on the disjunctive temporal problem 析取时态问题的跨学科实验评价
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-02-01 DOI: 10.1007/s10601-023-09342-7
Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi
{"title":"An interdisciplinary experimental evaluation on the disjunctive temporal problem","authors":"Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi","doi":"10.1007/s10601-023-09342-7","DOIUrl":"https://doi.org/10.1007/s10601-023-09342-7","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"1 - 12"},"PeriodicalIF":1.6,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43555483","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
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. 具有循环偏好的三维稳定匹配问题的松弛计算。
IF 1.6 4区 计算机科学
Constraints Pub Date : 2023-01-01 Epub Date: 2023-06-03 DOI: 10.1007/s10601-023-09346-3
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
{"title":"Computing relaxations for the three-dimensional stable matching problem with cyclic preferences.","authors":"Ágnes Cseh,&nbsp;Guillaume Escamocher,&nbsp;Luis Quesada","doi":"10.1007/s10601-023-09346-3","DOIUrl":"10.1007/s10601-023-09346-3","url":null,"abstract":"<p><p>Constraint programming has proven to be a successful framework for determining whether a given instance of the three-dimensional stable matching problem with cyclic preferences (3dsm-cyc) admits a solution. If such an instance is satisfiable, constraint models can even compute its optimal solution for several different objective functions. On the other hand, the only existing output for unsatisfiable 3dsm-cyc instances is a simple declaration of impossibility. In this paper, we explore four ways to adapt constraint models designed for 3dsm-cyc to the maximum relaxation version of the problem, that is, the computation of the smallest part of an instance whose modification leads to satisfiability. We also extend our models to support the presence of costs on elements in the instance, and to return the relaxation with lowest total cost for each of the four types of relaxation. Empirical results reveal that our relaxation models are efficient, as in most cases, they show little overhead compared to the satisfaction version.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 2","pages":"138-165"},"PeriodicalIF":1.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10400706/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10006293","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}
引用次数: 0
Towards better heuristics for solving bounded model checking problems 求解有界模型检验问题的更好启发式方法
IF 1.6 4区 计算机科学
Constraints Pub Date : 2022-12-27 DOI: 10.1007/s10601-022-09339-8
Anissa Kheireddine, E. Renault, S. Baarir
{"title":"Towards better heuristics for solving bounded model checking problems","authors":"Anissa Kheireddine, E. Renault, S. Baarir","doi":"10.1007/s10601-022-09339-8","DOIUrl":"https://doi.org/10.1007/s10601-022-09339-8","url":null,"abstract":"","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"28 1","pages":"45 - 66"},"PeriodicalIF":1.6,"publicationDate":"2022-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47298539","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
首页 上一页 下一页 尾页
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学术官方微信