A Filter for the Circuit Constraint

Citation data:

Principles and Practice of Constraint Programming - CP 2006, ISSN: 0302-9743, Vol: 0, Page: 706-710

Publication Year:
2006
Usage 113
Downloads 74
Abstract Views 39
Citations 1
Citation Indexes 1
Repository URL:
http://repository.cmu.edu/tepper/163
DOI:
10.1007/11889205_55
Author(s):
Genç-Kaya, Latife; Hooker, John N.
Publisher(s):
Springer Nature; Springer
Tags:
Economic Policy; Economics; Industrial Organization
book chapter description
We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonhamiltonian edges from the associated graph. We identify nonhamiltonian edges by analyzing a smaller graph with labeled edges that is defined on a separator of the original graph. The complexity of the procedure for each separator S is approximately O(|S|5).We found that it identified all infeasible instances and eliminated about one-third of the redundant domain elements in feasible instances.