Generalizing alldifferent: The somedifferent constraint

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

Volumn 4204 LNCS, Issue , 2006, Pages 468-483

  Richter, Yossi ^a   Freund, Ari ^a   Naveh, Yehuda ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NUMBER THEORY; PROBLEM SOLVING;

PROPAGATION ALGORITHMS; SYNTHETIC DATA; WORKFORCE MANAGEMENT; WORKFORCE MANAGEMENT PROBLEMS;

CONSTRAINT THEORY;

EID: 33750332503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_34     Document Type: Conference Paper

References (21)

1. G. Appa, D. Magos, and I. Mourtos. On the system of two all-different predicates. Info. Process. Letters, 94(3):99-105, 2005.
2. N. Barnier and P. Brisset. Graph coloring for air traffic flow management. In Proc. of 4th CP-AI-OR workshop, pages 133-147, 2002.
3. n). J. of Algorithms, 54(2): 168-204, 2005.
4. H. L. Bodlaender and D. Kratsch. An exact algorithm for graph coloring with polynomial memory. Technical Report UU-CS-2006-015. Department of Information and Computing Sciences. Utrecht University, 2006.
5. D. Brelaz. New methods to color the vertices of a graph. Communication of ACM, 22(4):251-256, 1979.
6. J. M. Byskov. Exact algorithms for graph colouring and exact satisfiability. PhD thesis, University of Aarhus. Aarhus, Denmark. 2005.
7. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, San Francisco, 2003.
8. D. Eppstein. Small maximal independent sets and faster excat graph coloring. J. Graph Algorithms and Applications, 7(2):131-140, 2003.
9. M. Grönkvist. A constraint programming model for tail assignment. In Proc. of 1st CP-AI-OR Conf., pages 142-156, 2004.
10. W. Klotz. Graph coloring algorithms. Technical Report Mathematik-Bericht 2002/5 TU Clausthal, 2002.
11. E. L. Lawler. A note on the complexity of the chromatic number problem. Info. Process. Letters, 5(3):66-67, 1976.
12. Y. Naveh and R. Emek. Random stimuli generation for functional hardware verification as a cp application. In Peter van Beek, editor, CP, volume 3709 of Lecture Notes in Computer Science, pages 882-882. Springer, 2005.
13. C.-G. Quimper, P. van Beek, A. López-Ortiz, A. Golynski, and S. B. Sadjad. An efficient bounds consistency algorithm for global cardinality constraint. In Proc. of Principles and Practice of Constraint Programming (CP), pages 600-614, 2003.
14. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. Technical Report R.R.LIRMM 93-068, 1993. Conf. version at AAAI-94.
15. M. Sellmann. Approximated consistency for knapsack constraints. In Proc. of Principles and Practice of Constraint Programming (CP), pages 679-693, 2003.
16. M. Sellmann. Cost-based filtering for shorter path constraints. In Proc. of Principles and Practice of Constraint Programming (CP), pages 694-708, 2003.
17. M. Sellmann. Approximated consistency for the automatic recording problem. In Proc. of Principles and Practice of Constraint Programming (CP), pages 822-826, 2005.
18. E. Tsang, J. Ford, P. Mills, R. Bradwell, R. Williams, and P. Scott. ZDC-rostering: A personnel scheduling system based on constraint programming. Technical Report 406, University of Essex, Colchester, UK, 2004.
19. W.-J. van Hoeve. The Alldifferent constraint: a systematic overview. 2006. Under construction. http://www.cs.cornell.edu/~vanhoeve.
20. D. B. West. Introduction to graph theory. Prentice Hall, 2000.
21. R. Yang. Solving a workforce management problem with constraint programming. In The 2nd International Conference on the Practical Application of Constraint Technology, pages 373-387. The Practical Application Company Ltd, 1996.