Global constraints as graph properties on a structured network of elementary constraints of the same type

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

Volumn 1894, Issue , 2000, Pages 52-66

  Beldiceanu, Nicolas ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

AS GRAPH; CLASSIFICATION SCHEME; GLOBAL CONSTRAINTS; GRAPH PROPERTIES; STRUCTURED NETWORKS;

CONSTRAINT THEORY;

EID: 84945980778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_6     Document Type: Conference Paper

References (17)

1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems, Mathl. Comput. Modelling 17 (7), 57-73 (1993).
2. Beldiceanu, N., Contejean, E.: Introducing global constraint in CHIP. Mathl. Comput. Modelling Vol. 20, No. 12, 97-123 (1994).
3. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
4. Beldiceanu, N.: Sweep as a generic pruning technique. SICS Technical Report T2000/08, (2000).
5. Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. SICS Technical Report T2000/10, (2000).
6. Beldiceanu, N.: Pruning for the cardinality-path constraint family. SICS Technical Report T2000/11, (2000).
7. Beldiceanu, N.: A generic sweep algorithm for the maximum resource constraint family. SICS Technical Report T2000/12, (2000).
8. Berge, C.: Graphes. Dunod, 1970; Graphs, Second Revised Edition. North-Holland, New York (1985). In French.
9. Berge, C.: Hypergraphes, Combinatoire des ensembles finis. Dunod, (1987). In French.
10. Graham, R. L., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G.: ‘Optimization and approximation in deterministic sequencing and scheduling: a survey’, Ann. Discrete Math., 5, 287-326 (1979).
11. Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling Problems. in: Weglarz J. (Ed.), Handbook on Recent advances in Pro}ect Scheduling, Kluwer Academic Publishers, (1998).
12. McKee, T. A., McMorris, F. R.: Topics in Intersection Graph Theory. Siam Monographs on Discrete Mathematics and Applications, (February 1999).
13. Pesant, G., Soriano, P.: An Optimal Strategy for the Constrained Cycle Cover Problem. CRT Pub. no 98-65, (14 pages), (December 1998).
14. Regin, J-C.: Generalized Arc Consistency for Global Cardinality Constraint. In Proc. of the Fourteenth National Conference on Artificial Intelligence (AAAI-96), (1996).
15. Sedgewick, R., Flajolet, P.: An introduction to the analysis of algorithms. Addison-Wesley, (1996).
16. Skiena, S.: Implementing Discrete Mathematics. Combinatoric and Graph Theory with Mathematica. Addison-Wesley, (1990).
17. Zhou, J.: A permutation-based approach for solving the job-shop problem. Constraints, 2(2), 185-213, (1997).