Pruning for the minimum constraint family and for the number of distinct values constraint family

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

Volumn 2239, Issue , 2001, Pages 211-224

  Beldiceanu, Nicolas ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FREQUENCY ALLOCATION;

ALLDIFFERENT; PROPAGATION RULE; PRUNING ALGORITHMS; S-ALGORITHMS; TIMETABLING;

COMPUTER PROGRAMMING;

EID: 84947922824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_15     Document Type: Conference Paper

References (9)

1. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
2. Cormen, T. H., Leiserson, C. E., Rivest R. L.: Introduction to Algorithms. The MIT Press, (1990).
3. Costa, M-C.: Persistency in maximum cardinality bipartite matchings. Operation Research Letters 15, 143-149, (1994).
4. Damaschke, P., Müller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Information Processing Letters 36, 231-236, (1990).
5. Garey, M. R., Johnson, D. S.: Computers and intractability. A guide to the Theory of NP-Completeness. W. H. Freeman and Company, (1979).
6. Pachet, F., Roy, P.: Automatic Generation of Music Programs. In Principles and Practice of Constraint Programming - CP’99, 5th International Conference, Alexandria, Virginia, USA, (October 11-14, 1999), Proceedings. Lecture Notes in Computer Science, Vol. 1713, Springer, (1999).
7. Régin, J-C.: A filtering algorithm for constraints of difference in CSP. In Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94), 362-367, (1994).
8. Régin, J-C.: Développement d'outils algorithmiques pour l'Intelligence Artificielle. Application à la chimie organique, PhD Thesis of LIRMM, Montpellier, France, (1995). In French.
9. Steiner, G., Yeomans, J.S.: A Linear Time Algorithm for Maximum Matchings in Convex, Bipartite Graph. In Computers Math. Applic., Vol. 31, No. 12, 91-96, (1996).