.png){kind=icon}
返回
Approximated consistency for the automatic recording constraint
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.08.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce the automatic recording constraint (ARC) that can be used to model and solve scheduling problems where tasks may not overlap in time and the tasks linearly exhaust some resource. Since achieving generalized arc-consistency for the ARC is NP-hard, we develop a filtering algorithm that achieves approximated consistency only. Numerical results show the benefits of the new constraint on three out of four different types of benchmark sets for the automatic recording problem. On these instances, run-times can be achieved that are orders of magnitude better than those of the best previous constraint programming approach. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Global constraints
Optimization constraints
Cost-based filtering
Relaxed consistency
Approximation algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Constraint programming based Lagrangian relaxation for the automatic recording problem基于约束规划的拉格朗日松弛求解自动录音问题
PREAI
分享收藏
查看更多内容