Abstract
This paper introduces a classification scheme for global constraints. This classification is based on a small number of basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in terms of graph properties that have to hold, where the graph is a structured network of same elementary constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems, Mathl. Comput. Modelling 17(7), 57–73 (1993).
Beldiceanu, N., Contejean, E.: Introducing global constraint in CHIP. Mathl. Comput. Modelling Vol. 20, No. 12, 97–123 (1994).
Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
Beldiceanu, N.: Sweep as a generic pruning technique. SICS Technical Report T2000/08, (2000).
Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. SICS Technical Report T2000/10, (2000).
Beldiceanu, N.: Pruning for the cardinality-path constraint family. SICS Technical Report T2000/11, (2000).
Beldiceanu, N.: A generic sweep algorithm for the maximum resource constraint family. SICS Technical Report T2000/12, (2000).
Berge, C: Graphes. Dunod, 1970; Graphs, Second Revised Edition. North-Holland, New York (1985). In French.
Berge, C: Hypergraphes, Combinatoire des ensembles finis. Dunod, (1987). In French.
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).
Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling Problems. in: Weglarz J. (Ed.), Handbook on Recent advances in Project Scheduling, Kluwer Academic Publishers, (1998).
McKee, T. A., McMorris, F. R.: Topics in Intersection Graph Theory Siam Monographs on Discrete Mathematics and Applications, (February 1999).
Pesant, G., Soriano, P.: An Optimal Strategy for the Constrained Cycle Cover Problem. CRT Pub. no 98-65, (14 pages), (December 1998).
Régin, J-C: Generalized Arc Consistency for Global Cardinality Constraint. In Proc. of the Fourteenth National Conference on Artificial Intelligence (AAAI-96), (1996).
Sedgewick, R., Flajolet, P.: An introduction to the analysis of algorithms. Addison-Wesley, (1996).
Skiena, S.: Implementing Discrete Mathematics. Combinatoric and Graph Theory with Mathematica. Addison-Wesley, (1990).
Zhou, J.: A permutation-based approach for solving the job-shop problem. Constraints, 2(2), 185–213, (1997).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beldiceanu, N. (2000). Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive