A Filter for the Circuit Constraint
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.
KeywordsDirected Graph Hamiltonian Cycle Vertex Degree Label Edge Small Graph
Unable to display preview. Download preview PDF.
- 1.Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: Naish, L. (ed.) Proceedings, Fourteenth International Conference on Logic Programming (ICLP 1997), pp. 316–330. MIT Press, Cambridge (1997)Google Scholar