Approximated consistency for the automatic recording constraint

被引：1
|
作者：
Sellmann, Meinolf [1 ]
机构：
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源：
COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 08期
基金：
美国国家科学基金会;
关键词：
Global constraints; Optimization constraints; Cost-based filtering; Relaxed consistency; Approximation algorithms; LAGRANGIAN-RELAXATION; KNAPSACK;
D O I：
10.1016/j.cor.2008.08.009
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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.
引用
收藏
页码：2341 / 2347
页数：7
相关论文
共 50 条
  • [1] Approximated consistency for the automatic recording problem
    Sellmann, M
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 822 - 826
  • [2] Approximated consistency for knapsack constraints
    Sellmann, M
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 679 - 693
  • [3] Constraint programming based Lagrangian relaxation for the automatic recording problem
    Sellmann, M
    Fahle, T
    [J]. ANNALS OF OPERATIONS RESEARCH, 2003, 118 (1-4) : 17 - 33
  • [4] Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem
    Meinolf Sellmann
    Torsten Fahle
    [J]. Annals of Operations Research, 2003, 118 : 17 - 33
  • [5] The geometric consistency index:: Approximated thresholds
    Aguarón, J
    Moreno-Jiménez, JM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (01) : 137 - 145
  • [6] The practice of approximated consistency for knapsack constraints
    Sellmann, M
    [J]. PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 179 - 184
  • [7] On the transitivity and consistency approximated thresholds of some consistency indices for pairwise comparison matrices
    Amenta, Pietro
    Lucadamo, Antonio
    Marcarelli, Gabriella
    [J]. INFORMATION SCIENCES, 2020, 507 (507) : 274 - 287
  • [8] THE VIEWPOINT CONSISTENCY CONSTRAINT
    LOWE, DG
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 1987, 1 (01) : 57 - 72
  • [9] ROLL ANGLE CONSISTENCY CONSTRAINT
    WORRALL, AD
    BAKER, KD
    SULLIVAN, GD
    [J]. IMAGE AND VISION COMPUTING, 1990, 8 (01) : 78 - 84
  • [10] Consistency and random constraint satisfaction models with a high constraint tightness
    Gao, Y
    Culberson, J
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 17 - 31
12345