A hyper-arc consistency algorithm for the soft alldifferent constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 679-689

  Van Hoeve, Willem Jan ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; COST ACCOUNTING;

ALLDIFFERENT; ARC CONSISTENCY; ARC-CONSISTENCY ALGORITHMS; CARDINALITIES; MINIMUM COST FLOW PROBLEM;

ALGORITHMS;

EID: 33947495614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_49     Document Type: Article

References (14)

1. K.R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
2. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Satisfaction and Optimization. Journal of the ACM, 44(2):201-236, 1997.
3. Y. Caseau and F. Laburthe. Solving Various Weighted Matching Problems with Constraints. In G. Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP'97), volume 1330 of LNCS, pages 17-31. Springer, 1997.
4. M.C. Cooper and T. Schiex. Arc consistency for soft constraints. Artificial Intelligence, 2004. To appear.
5. L.R. Ford and D.R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
6. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21-70, 1992.
7. T. Petit, J.-C. Régin, and C. Bessière. Specific Filtering Algorithms for Over-Constrained Problems. In T. Walsh, editor, Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP 2001), volume 2239 of LNCS, pages 451-463. Springer, 2001.
8. J.-C. Régin. A Filtering Algorithm for Constraints of Difference in CSPs. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), volume 1, pages 362-367, 1994.
9. J.-C. Régin. Arc Consistency for Global Cardinality Constraints with Costs. In J. Jaffar, editor, Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming (CP'99), volume 1713 of LNCS, pages 390-404. Springer, 1999.
10. J.-C. Régin. Cost-Based Arc Consistency for Global Cardinality Constraints. Constraints, 7:387-405, 2002.
11. J.-C. Régin, T. Petit, C. Bessière, and J.-F. Puget. An Original Constraint Based Approach for Solving over Constrained Problems. In R. Dechter, editor, Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP 2000), volume 1894 of LNCS, pages 543-548. Springer, 2000.
12. A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer, 2003.
13. M. Sellmann. An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. In P. Van Hentenryck, editor, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of LNCS, pages 744-749. Springer, 2002.
14. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.