{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:49:43Z","timestamp":1769838583534,"version":"3.49.0"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,2,17]],"date-time":"2007-02-17T00:00:00Z","timestamp":1171670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,3,20]]},"DOI":"10.1007\/s10601-006-9010-8","type":"journal-article","created":{"date-parts":[[2007,2,16]],"date-time":"2007-02-16T13:07:12Z","timestamp":1171631232000},"page":"21-62","source":"Crossref","is-referenced-by-count":50,"title":["Global Constraint Catalogue: Past, Present and Future"],"prefix":"10.1007","volume":"12","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Demassey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,17]]},"reference":[{"issue":"7","key":"9010_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., \u2009& Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1\/2","key":"9010_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., \u2009& Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1\/2), 119\u2013139.","journal-title":"Constraints"},{"key":"9010_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00291-003-0155-1","volume":"26","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., \u2009& Demassey, S. (2004). Tight LP bounds for resource constrained project scheduling. OR-Spektrum, 26, 251\u2013262.","journal-title":"OR-Spektrum"},{"key":"9010_CR4","unstructured":"Beldiceanu, N. (1990). An example of introduction of global constraints in CHIP: Application to block theory problems. Technical report TR-LP-49, ECRC, Munich."},{"key":"9010_CR5","first-page":"52","volume-title":"Principles and practice of Constraint Programming (CP\u20192000), volume 1894 of LNCS","author":"N. Beldiceanu","year":"2000","unstructured":"Beldiceanu, N. (2000). Global constraints as graph properties on a structured network of elementary constraints of the same type. In R. Dechter (Ed.), Principles and practice of Constraint Programming (CP\u20192000), volume 1894 of LNCS (pp. 52\u201366). Berlin Heidelberg New York: Springer. Preprint available as SICS Tech Report T2000-01."},{"issue":"12","key":"9010_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., \u2009& Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical and Computer Modelling"},{"key":"9010_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-24664-0_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 3011 of LNCS","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., \u2009& Petit, T. (2004). Cost evaluation of soft global constraints. In J.-C. R\u00e9gin \u2009& M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 3011 of LNCS (pp. 80\u201395). Berlin Heidelberg New York: Springer."},{"key":"9010_CR8","first-page":"107","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., \u2009& Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp 107\u2013122). Berlin Heidelberg New York: Springer. Preprint available as SICS Tech Report T2004-08."},{"key":"9010_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-540-24664-0_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2004), volume 3011 of LNCS","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Katriel, I., \u2009& Thiel, S. (2004). Filtering algorithms for the same constraint. In J.-C. R\u00e9gin \u2009& M. Rueher (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2004), volume 3011 of LNCS (pp 65\u201379). Berlin Heidelberg New York: Springer."},{"issue":"3","key":"9010_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10601-005-2809-x","volume":"10","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Carlsson, M., Debruyne, R., \u2009& Petit, T. (2005). Reformulation of global constraints based on constraint checkers. Constraints, 10(3), 339\u2013362.","journal-title":"Constraints"},{"key":"9010_CR11","unstructured":"Beldiceanu, N., Carlsson, M., \u2009& Rampon, J.-X. (2005). Global constraint catalog. Technical Report T2005-06, Swedish Institute of Computer Science, Kista."},{"key":"9010_CR12","first-page":"92","volume-title":"Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X., \u2009& Truchet, C. (2005). Graph invariants as necessary conditions for global constraints. In P. van Beek (Ed.), Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS (pp 92\u2013106). Berlin Heidelberg New York: Springer. Preprint available as SICS Tech Report T2005-07.","edition":"7"},{"key":"9010_CR13","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Flener, P., \u2009& Lorca, X. (May 2005) The tree constraint. In R. Bart\u00e1k \u2009& M. Milano (Eds.), International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR\u201905), volume 3524 of LNCS (pp. 64\u201378). Prague, Czech Republic. Berlin Heidelberg New York: Springer.","DOI":"10.1007\/11493853_7"},{"key":"9010_CR14","first-page":"1","volume-title":"Springer LNAI volume based on the 2004 edition of the ERCIM\/Colognet workshop on Constraint Solving and Constraint Logic Programming (CSCLP04), volume 3419 of LNAI","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Katriel, I., \u2009& Thiel, S. (2005). GCC-like restrictions on the same constraint. In B. Faltings, A. Petcu, F. Fages, \u2009& F. Rossi (Eds.), Springer LNAI volume based on the 2004 edition of the ERCIM\/Colognet workshop on Constraint Solving and Constraint Logic Programming (CSCLP04), volume 3419 of LNAI (pp. 1\u201311). Berlin Heidelberg New York: Springer."},{"key":"9010_CR15","first-page":"742","volume-title":"Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Petit, T., \u2009& Rochart, G. (2005). Bounds of graph characteristics. In P. van Beek (Ed.), Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS (pp. 742\u2013746). Berlin Heidelberg New York: Springer."},{"key":"9010_CR16","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Petit, T., \u2009& Rochart, G. (2005). Bounds of graph characteristics. Technical Report 05\/2\/INFO. Ecole des Mines, Paris.","DOI":"10.1007\/11564751_56"},{"key":"9010_CR17","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., \u2009& Petit, T. (2006). Graph properties based filtering. Technical Report T2006-10, Swedish Institute of Computer Science, Kista, Sweden.","DOI":"10.1007\/11889205_7"},{"key":"9010_CR18","volume-title":"CP-AI-OR\u201906, volume 3990 of LNCS","author":"N. Beldiceanu","year":"2006","unstructured":"Beldiceanu, N., Katriel, I., \u2009& Lorca, X. (2006). Undirected forest constraints. In CP-AI-OR\u201906, volume 3990 of LNCS. Berlin Heidelberg New York: Springer."},{"key":"9010_CR19","unstructured":"Berge, C. (1970). Graphes. Dunod (in French)."},{"key":"9010_CR20","first-page":"789","volume-title":"Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS","author":"C. Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., \u2009& Van Hentenryck, P. (2003). To be or not to be... a global constraint. In F. Rossi (Ed.), Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS (pp. 789\u2013794). Berlin Heidelberg New York: Springer."},{"key":"9010_CR21","first-page":"747","volume-title":"Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., Coletta, R., \u2009& Petit, T. (2005). Acquiring parameters of implied global constraints. In P. van Beek (Ed.), Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS (pp. 747\u2013751). Berlin Heidelberg New York: Springer."},{"key":"9010_CR22","first-page":"223","volume-title":"CSCLP 2005","author":"C. Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., K\u0131z\u0131ltan, Z., \u2009& Walsh, T. (2005). Among, common and disjoint constraints. In CSCLP 2005, pp. 223\u2013235. Uppsala, Sweden. Berlin Heidelberg New York: Springer."},{"key":"9010_CR23","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., K\u0131z\u0131ltan, Z., \u2009& Walsh, T. (May 2005). Filtering algorithms for the nvalue constraint. In R. Bart\u00e1k \u2009& M. Milano (Eds.), International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR\u201905), volume 3524 of LNCS, (pp. 79\u201393). Prague, Czech Republic. Berlin Heidelberg New York: Springer.","DOI":"10.1007\/11493853_8"},{"key":"9010_CR24","first-page":"2","volume-title":"Principles and Practice of Constraint Programming (CP\u201997), volume 1330 of LNCS","author":"N. Bleuzen-Guernalec","year":"1997","unstructured":"Bleuzen-Guernalec, N., \u2009& Colmerauer, A. (1997). Narrowing a block of sortings in quadratic time. In G. Smolka (Ed.), Principles and Practice of Constraint Programming (CP\u201997), volume 1330 of LNCS (pp. 2\u201316). Berlin Heidelberg New York: Springer."},{"key":"9010_CR25","unstructured":"Card, S. K., Mackinlay, J. D., \u2009& Shneiderman, B. (1999). Readings in information visualization using vision to think. Morgan Kaufmann."},{"key":"9010_CR26","unstructured":"Carlsson, M., \u2009& Beldiceanu, N. (2002). Arc-consistency for a chain of lexicographic ordering constraints. Technical Report T2002-18, Swedish Institute of Computer Science, Kista, Sweden."},{"key":"9010_CR27","unstructured":"Caseau, Y., \u2009& Laburthe, F. (1996). Cumulative scheduling with task intervals. In Joint International Conference and Symposium on Logic Programming (JICSLP\u201996). MIT Press."},{"key":"9010_CR28","first-page":"575","volume-title":"Principles and Practice of Constraint Programming (CP\u20192001), volume 2239 of LNCS","author":"S. Colton","year":"2001","unstructured":"Colton, S., \u2009& Miguel, I. (2001). Constraint generation via automated theory formation. In T. Walsh (Ed.), Principles and Practice of Constraint Programming (CP\u20192001), volume 2239 of LNCS (pp. 575\u2013579). Berlin Heidelberg New York: Springer."},{"key":"9010_CR29","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6377(94)90049-3","volume":"15","author":"M.-C. Costa","year":"1994","unstructured":"Costa, M.-C. (1994). Persistency in maximum cardinality bipartite matchings. Operation Research Letters, 15, 143\u2013149.","journal-title":"Operation Research Letters"},{"key":"9010_CR30","volume-title":"Analysis and Visualization Tools for Constraint Programming, Constraint Debugging (DiSCiPl project), volume 1870 of LNCS","year":"2000","unstructured":"Deransart, P., Hermenegildo, M. V., \u2009& Maluszynski, J. (Eds.) (2000). Analysis and Visualization Tools for Constraint Programming, Constraint Debugging (DiSCiPl project), volume 1870 of LNCS. Berlin Heidelberg New York: Springer."},{"key":"9010_CR31","first-page":"693","volume-title":"International Conference on Fifth Generation Computer Systems (FGCS\u201988)","author":"M. Dincbas","year":"1988","unstructured":"Dincbas, M., Van Hentenryck, P., Simonis, H., Graf, T., Aggoun, A., \u2009& Berthier, F. (1988). The constraint logic programming language CHIP. In International Conference on Fifth Generation Computer Systems (FGCS\u201988) (pp. 693\u2013702). Tokyo, Japan: ICOT."},{"key":"9010_CR32","first-page":"211","volume-title":"Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., \u2009& Dupont, P. (2005). CP(Graph): Introducing a graph computation domain in constraint. In P. van Beek (Ed.), Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS (pp. 211\u2013225). Berlin Heidelberg New York: Springer."},{"key":"9010_CR33","unstructured":"Dudeney, H. E. (1919). The Canterbury puzzles. Nelson."},{"key":"9010_CR34","first-page":"106","volume-title":"Algorithms and Computation, 16th International Symposium (ISAAC 2005), volume 3827 of LNCS","author":"K. M. Elbassioni","year":"2005","unstructured":"Elbassioni, K. M., Katriel, I., Kutz, M., \u2009& Mahajan, M. (2005). Simultaneous matchings. In Algorithms and Computation, 16th International Symposium (ISAAC 2005), volume 3827 of LNCS (pp. 106\u2013115). Berlin Heidelberg New York: Springer."},{"key":"9010_CR35","first-page":"115","volume-title":"2nd International Workshop on Project Management and Scheduling","author":"J. Erschler","year":"1990","unstructured":"Erschler, J., \u2009& Lopez, P. (June 1990). Energy-based approach for task scheduling under time and resources constraints. In 2nd International Workshop on Project Management and Scheduling (pp. 115\u2013121). France: Compi\u00e9gne."},{"key":"9010_CR36","first-page":"310","volume":"15","author":"L. Euler","year":"1759","unstructured":"Euler, L. (1759). Solution d\u2019une question curieuse qui ne parait soumise \u00e0 aucune analyse. Mm. Acad. Sci. Berlin, 15, 310\u2013337.","journal-title":"Mm. Acad. Sci. Berlin"},{"key":"9010_CR37","unstructured":"Flener, P., Frisch, A. M., Hnich, B., K\u0131z\u0131ltan, Z., Miguel, I., \u2009& Walsh, T. (2002). Matrix modelling: Exploiting common patterns in constraint programming. In A. M. Frisch (Ed.), Proceedings of the International Workshop on Reformulating CSPs, held at CP\u201902."},{"issue":"1","key":"9010_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1009749006768","volume":"2","author":"E. C. Freuder","year":"1997","unstructured":"Freuder, E. C. (1997). In pursuit of the holy grail. Constraints, 2(1), 57\u201361.","journal-title":"Constraints"},{"key":"9010_CR39","unstructured":"Frisch, A. M., Jefferson, C., Martinez-Hernandez, B., \u2009& Miguel, I. (2005). The rules of constraint modelling. In 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (pp. 109\u2013116)."},{"key":"9010_CR40","unstructured":"Garey, M. R., \u2009& Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. Freeman."},{"key":"9010_CR41","unstructured":"Gu\u00e9ret, C., Jussien, N., Boizumault, P., \u2009& Prins, C. (August 1995). Building university timetables using constraint logic programming. In ICPTAT\u201995: First International Conference on the Practice and Theory of Automated Time Tabling (pp. 393\u2013408). Edinburgh, United Kingdom."},{"key":"9010_CR42","unstructured":"Hansen, P. (2005). How far is, should and could be conjecture-making in graph theory an automated process? In S. Fajtlowicz, P. W. Fowler, P. Hansen, M. F. Janowitz, \u2009& F. S. Roberts (Eds.), Graphs and Discovery, volume\u00a069 of DIMACS: Series in discrete mathematics and theoretical computer science (pp. 189\u2013230). American Mathematical Society, DIMACS."},{"key":"9010_CR43","first-page":"89","volume-title":"Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS\u201995, Aarhus, Denmark, volume 1019 of LNCS","author":"J. G. Henriksen","year":"1995","unstructured":"Henriksen, J. G., Jensen, J. L., J\u00f8rgensen, M. E., Klarlund, N., Paige, R., Rauhe, T., \u2009& Sandholm, A. (May 1995). Mona: Monadic second-order logic in practice. In E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, \u2009& B. Steffen (Eds.), Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS\u201995, Aarhus, Denmark, volume 1019 of LNCS (pp. 89\u2013110). Berlin Heidelberg New York: Springer."},{"key":"9010_CR44","unstructured":"Hnich, B. (January 2003). Function variables for constraint programming. Ph.D. Thesis, Department of Information Science, Uppsala University."},{"key":"9010_CR45","unstructured":"Hooker, J. (October 2005). Past and future of CP. Panel, \u201cThe Past and Future of Constraint Programming\u201d at the Eleventh International Conference on Principles and Practice of Constraint Programming. Available at http:\/\/www.iiia.csic.es\/cp2005\/CP05-panel-hooker.pdf ."},{"key":"9010_CR46","first-page":"686","volume-title":"Principles and Practice of Constraint Programming (CP\u20192002), volume 2470 of LNCS","author":"J. N. Hooker","year":"2002","unstructured":"Hooker, J. N., \u2009& Yan, H. (2002). A relaxation for the cumulative constraint. In P. Van Hentenryck (Ed.), Principles and Practice of Constraint Programming (CP\u20192002), volume 2470 of LNCS (pp. 686\u2013690). Berlin Heidelberg New York: Springer."},{"key":"9010_CR47","first-page":"437","volume-title":"Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS","author":"I. Katriel","year":"2003","unstructured":"Katriel, I., \u2009& Thiel, S. (2003). Fast bound consistency for the global cardinality constraint. In F. Rossi (Ed.), Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS (pp. 437\u2013451). Berlin Heidelberg New York: Springer."},{"issue":"3","key":"9010_CR48","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10601-005-2237-y","volume":"10","author":"I. Katriel","year":"2005","unstructured":"Katriel, I., \u2009& Thiel, S. (2005). Complete bound consistency for the global cardinality constraint. Constraints, 10(3), 191\u2013217.","journal-title":"Constraints"},{"key":"9010_CR49","first-page":"191","volume":"2","author":"T. P. Kirkman","year":"1847","unstructured":"Kirkman, T. P. (1847). On a problem in combinatorics. Cambridge and Dublin Math. J., 2, 191\u2013204.","journal-title":"Cambridge and Dublin Math. J."},{"key":"9010_CR50","first-page":"209","volume":"294","author":"A. Lahrichi","year":"1982","unstructured":"Lahrichi, A. (February 1982). Scheduling: The notions of hump, compulsory parts and their use in cumulative poblems. C.R. Acad. Sci., Paris 294: 209\u2013211.","journal-title":"C.R. Acad. Sci., Paris"},{"key":"9010_CR51","unstructured":"Lauri\u00e8re, J.-L. (1996). Constraint propagation or automatic programming? Technical Report Laforia, number 19, Institut Blaise Pascal (in French)."},{"key":"9010_CR52","unstructured":"Leconte, M. (1996). A bounds-based reduction scheme for constraints of difference. In CP\u201996, Second International Workshop on Constraint-based Reasoning (pp. 19\u201328). Key West, FL."},{"key":"9010_CR53","unstructured":"Lopez-Ortiz, A., Quimper, C.-G., Tromp, J., \u2009& van Beek, P. (2003). A fast and simple algorithm for bounds consistency of the alldifferent constraint. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI\u20192003) (pp. 245\u2013250)."},{"key":"9010_CR54","unstructured":"Lucas, E. (1882). R\u00e9cr\u00e9ations Math\u00e9matiques, volume 1-2. Gauthier-Villars."},{"key":"9010_CR55","first-page":"571","volume-title":"27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000), volume 1853 of LNCS","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K. (2000). Constraint programming and graph algorithms. In U. Montanari, J. D. P. Rolim, \u2009& E. Welzl (Eds.), 27th International Colloquium on Automata, Languages and Programming (ICALP\u20192000), volume 1853 of LNCS (pp. 571\u2013575). Berlin Heidelberg New York: Springer."},{"key":"9010_CR56","first-page":"306","volume-title":"Principles and Practice of Constraint Programming (CP\u20192000), volume 1894 of LNCS","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., \u2009& Thiel, S. (2000). Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In Principles and Practice of Constraint Programming (CP\u20192000), volume 1894 of LNCS (pp. 306\u2013319). Berlin Heidelberg New York: Springer."},{"issue":"4","key":"9010_CR57","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M. Milano","year":"2002","unstructured":"Milano, M., Ottoson, G., Refalo, P., \u2009& Thorsteinsson, E. (2002). The role of integer programming techniques in constraint programming\u2019s global constraints. INFORMS Journal on Computing, 14(4), 387\u2013402.","journal-title":"INFORMS Journal on Computing"},{"key":"9010_CR58","first-page":"331","volume-title":"Principles and Practice of Constraint Programming (CP\u201999), volume 1713 of LNCS","author":"F. Pachet","year":"1999","unstructured":"Pachet, F., \u2009& Roy, P. (1999). Automatic generation of music programs. In Principles and Practice of Constraint Programming (CP\u201999), volume 1713 of LNCS (pp. 331\u2013345). Berlin Heidelberg New York: Springer."},{"key":"9010_CR59","first-page":"482","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"G. Pesant","year":"2004","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp. 482\u2013495). Berlin Heidelberg New York: Springer."},{"key":"9010_CR60","first-page":"451","volume-title":"Principles and Practice of Constraint Programming (CP\u20192001), volume 2239 of LNCS","author":"T. Petit","year":"2001","unstructured":"Petit, T., R\u00e9gin, J.-C., \u2009& Bessi\u00e8re, C. (2001). Specific filtering algorithms for over-constrained problems. In T. Walsh (Ed.), Principles and Practice of Constraint Programming (CP\u20192001), volume 2239 of LNCS (pp. 451\u2013463). Berlin Heidelberg New York: Springer."},{"key":"9010_CR61","unstructured":"Pitrat, J. (September 2001). MALICE, notre coll\u00e8gue. In Colloque M\u00e9taconnaissance de Berder (pp. 4\u201319). In French."},{"key":"9010_CR62","unstructured":"Puget, J.-F. (November 1994). A C++ implementation of CLP. In Second Singapore International Conference on Intelligent Systems (SPICIS), pp. 256\u2013261. Singapore."},{"key":"9010_CR63","unstructured":"Puget, J.-F. (1998). A fast algorithm for the bound consistency of alldiff constraints. In 15th National Conference on Artificial Intelligence (AAAI-98) (pp. 359\u2013366). AAAI Press."},{"key":"9010_CR64","first-page":"5","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"J.-F. Puget","year":"2004","unstructured":"Puget, J.-F. (2004). Constraint programming next challenge: Simplicity of use. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp. 5\u20138). Berlin Heidelberg New York: Springer."},{"key":"9010_CR65","first-page":"475","volume-title":"Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F. (2005). Automatic detection of variable and value symmetries. In P. van Beek (Ed.), Principles and Practice of Constraint Programming (CP\u20192005), volume 3709 of LNCS (pp. 475\u2013489). Berlin Heidelberg New York: Springer."},{"key":"9010_CR66","first-page":"600","volume-title":"Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS","author":"C.-G. Quimper","year":"2003","unstructured":"Quimper, C.-G., van Beek, P., L\u00f3pez-Ortiz, A., Golynski, A., \u2009& Sadjad, S. B. (2003). An efficient bounds consistency algorithm for the global cardinality constraint. In F. Rossi (Ed.), Principles and Practice of Constraint Programming (CP\u20192003), volume 2833 of LNCS (pp. 600\u2013614). Berlin Heidelberg New York: Springer."},{"key":"9010_CR67","first-page":"542","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"C.-G. Quimper","year":"2004","unstructured":"Quimper, C.-G., L\u00f3pez-Ortiz, A., van Beek, P., \u2009& Golynski, A. (2004). Improved algorithms for the global cardinality constraint. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp. 542\u2013556). Berlin Heidelberg New York: Springer."},{"key":"9010_CR68","unstructured":"R\u00e9gin, J.-C. (1994). A filtering algorithm for constraints of difference in CSP. In 12th National Conference on Artificial Intelligence (AAAI-94), pp. 362\u2013367."},{"key":"9010_CR69","unstructured":"R\u00e9gin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In 14th National Conference on Artificial Intelligence (AAAI-96), pp. 209\u2013215."},{"key":"9010_CR70","unstructured":"R\u00e9gin, J.-C. (1999). The symmetric alldiff constraint. In 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 420\u2013425."},{"key":"9010_CR71","first-page":"572","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"J.-C. R\u00e9gin","year":"2004","unstructured":"R\u00e9gin, J.-C., \u2009& Gomes, C. (2004). The cardinality matrix constraint. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp. 572\u2013587). Berlin Heidelberg New York: Springer."},{"key":"9010_CR72","unstructured":"R\u00e9gin, J.-C., \u2009& Rueher, M. (1999). A global constraint combining a sum constraint and binary inequalities. In IJCAI-99 Workshop on Non Binary Constraints."},{"key":"9010_CR73","unstructured":"Rochart, G., \u2009& Jussien, N. (2003). Explanations for Global Constraints: Instrumenting the Stretch Constraint. Technical report 03-01-INFO, \u00c9cole des Mines de Nantes."},{"key":"9010_CR74","first-page":"299","volume-title":"Analysis and Vizualisation Tools for Constraint Programming, volume 1870 of LNCS","author":"H. Simonis","year":"2000","unstructured":"Simonis, H., Aggoun, A., Beldiceanu, N., \u2009& Bourreau, E. (2000). Complex constraint abstraction: Global constraint visualization. In P. Deransart, M. V. Hermenegildo, \u2009& J. Ma\u0142uszy\u0144ski (Eds.), Analysis and Vizualisation Tools for Constraint Programming, volume 1870 of LNCS (pp. 299\u2013317). Berlin Heidelberg New York: Springer."},{"key":"9010_CR75","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P. (1941). On an extremal problem in graph theory. Matematikai es\u2019 Fizikai Lapok, 48, 436\u2013452. In Hungarian.","journal-title":"Matematikai es\u2019 Fizikai Lapok"},{"issue":"1","key":"9010_CR76","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1009713426332","volume":"2","author":"P. Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P. (1997). Constraint programming for combinatorial search problems. Constraints, 2(1), 99\u2013101.","journal-title":"Constraints"},{"key":"9010_CR77","unstructured":"Van Hentenryck, P. (1999). The OPL optimization programming language. MIT Press."},{"key":"9010_CR78","unstructured":"Van Hentenryck, P., \u2009& Michel, L. (2005). Constraint-based local search. MIT Press."},{"key":"9010_CR79","first-page":"679","volume-title":"Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS","author":"W.-J. Hoeve van","year":"2004","unstructured":"van Hoeve, W.-J. (2004). A hyper-arc consistency algorithm for the soft alldifferent constraint. In M. Wallace (Ed.), Principles and Practice of Constraint Programming (CP\u20192004), volume 3258 of LNCS (pp. 679\u2013689). Berlin Heidelberg New York: Springer."},{"key":"9010_CR80","unstructured":"van Hoeve, W.-J., Pesant, G., \u2009& Rousseau, L.-M. (September 2004). On global warming (softening global constraints). In Workshop on soft constraints. Toronto, Canada."},{"key":"9010_CR81","unstructured":"Voigt, K. (1988). Incorporating global constraints. Technical Report LCSR-TR-114, Laboratory for Computer Science Research, Hill Center for the Mathematical Sciences, Busch Campus, Rutgers University, New Brunswick, NJ."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9010-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-006-9010-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9010-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:13Z","timestamp":1559229253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-006-9010-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,17]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s10601-006-9010-8","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,17]]}}}