Constraints最新文献_第8页

IBM ILOG CP optimizer for scheduling 用于调度的IBM ILOG CP优化器

IF 1.6 4区计算机科学

Constraints Pub Date : 2018-03-19 DOI: 10.1007/s10601-018-9281-x

Philippe Laborie, J. Rogerie, Paul Shaw, Petr Vilím

引用次数: 203

How efficient is a global constraint in practice? 在实践中，全局约束的效率如何?

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-10-13 DOI: 10.1007/s10601-017-9277-y

Sascha Van Cauwelaert, M. Lombardi, P. Schaus

引用次数: 5

Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs 用GPU加速（分布式）离散优化的精确和近似推理

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-08-18 DOI: 10.1007/s10601-017-9274-1

Ferdinando Fioretto, Enrico Pontelli, W. Yeoh, R. Dechter

引用次数: 16

What is answer set programming to propositional satisfiability 命题可满足性的答案集规划是什么

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-07-01 DOI: 10.1007/s10601-016-9257-7

Y. Lierler

引用次数: 17

Mining Time-constrained Sequential Patterns with Constraint Programming 基于约束规划的时序模式挖掘

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-06-07 DOI: 10.1007/s10601-017-9272-3

John Oscar Raoul Aoga, Tias Guns, P. Schaus

引用次数: 19

A global constraint for over-approximation of real-time streams 实时流过度逼近的全局约束

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-05-31 DOI: 10.1007/s10601-017-9268-z

Anicet Bart, C. Truchet, É. Monfroy

引用次数: 1

Deriving generic bounds for time-series constraints based on regular expressions characteristics 基于正则表达式特征导出时间序列约束的通用边界

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-03-20 DOI: 10.1007/s10601-017-9276-z

Ekaterina Arafailova, Nicolas Beldiceanu, H. Simonis

引用次数: 5

Domain reduction techniques for global NLP and MINLP optimization 面向全局NLP和MINLP优化的域约简技术

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-01-14 DOI: 10.1007/s10601-016-9267-5

Yash Puranik, N. Sahinidis

引用次数: 62

"Almost-stable" matchings in the Hospitals / Residents problem with Couples. “几乎稳定”的配对在医院/住院医生与夫妇的问题。

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-01-01 Epub Date: 2016-08-11 DOI: 10.1007/s10601-016-9249-7

David F Manlove, Iain McBride, James Trimble

{"title":"\"Almost-stable\" matchings in the Hospitals / Residents problem with Couples.","authors":"David F Manlove, Iain McBride, James Trimble","doi":"10.1007/s10601-016-9249-7","DOIUrl":"https://doi.org/10.1007/s10601-016-9249-7","url":null,"abstract":"<p><p>The Hospitals / Residents problem with Couples (hrc) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider min bp hrc, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is \"as stable as possible\"). We show that this problem is NP-hard and difficult to approximate even in the highly restricted case that each couple finds only one hospital pair acceptable. However if we further assume that the preference list of each single resident and hospital is of length at most 2, we give a polynomial-time algorithm for this case. We then present the first Integer Programming (IP) and Constraint Programming (CP) models for min bp hrc. Finally, we discuss an empirical evaluation of these models applied to randomly-generated instances of min bp hrc. We find that on average, the CP model is about 1.15 times faster than the IP model, and when presolving is applied to the CP model, it is on average 8.14 times faster. We further observe that the number of blocking pairs admitted by a solution is very small, i.e., usually at most 1, and never more than 2, for the (28,000) instances considered.</p>","PeriodicalId":55211,"journal":{"name":"Constraints","volume":"22 1","pages":"50-72"},"PeriodicalIF":1.6,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10601-016-9249-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37815926","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}

引用次数: 37

Towards statistical consistency for stochastic constraint programming 随机约束规划的统计一致性

IF 1.6 4区计算机科学

Constraints Pub Date : 2017-01-01 DOI: 10.1007/s10601-016-9264-8

Imen Zghidi

引用次数: 1