A filter for the circuit constraint

Authors:
Latife Genç Kaya;J. N. Hooker
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh;Tepper School of Business, Carnegie Mellon University, Pittsburgh
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 1
Cited 3

Generating Hamiltonian circuits without backtracking from errors

Theoretical Computer Science

Necessary Condition for Path Partitioning Constraints

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Improved filtering for weighted circuit constraints

Constraints
Explaining circuit propagation

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.