{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T05:25:53Z","timestamp":1736832353829,"version":"3.33.0"},"reference-count":30,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1051\/ro:2007001","type":"journal-article","created":{"date-parts":[[2007,2,13]],"date-time":"2007-02-13T09:18:42Z","timestamp":1171358322000},"page":"327-353","source":"Crossref","is-referenced-by-count":1,"title":["Bounds of graph parameters for global constraints"],"prefix":"10.1051","volume":"40","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Rochart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"R1","unstructured":"P. Baptiste, C. Le Pape and L. Peridy, Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints, inPrinciples and Practice of Constraint Programming (CP'98), edited by M. Maher and J.-F. Puget, Springer-Verlag,Lect. Notes Comput. Sci.1520(1998) 87\u2013101."},{"key":"R2","unstructured":"N. Beldiceanu, Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type, inPrinciples and Practice of Constraint Programming (CP'2000), edited by R. Dechter, Springer-Verlag,Lect. Notes Comput. Sci.1894(2000) 52\u201366. Preprint available as SICS Tech Report T2000-01."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"N. Beldiceanu,Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type.Technical Report T2000-01, Swedish Institute of Computer Science (2000).","DOI":"10.1007\/3-540-45349-0_6"},{"key":"R4","unstructured":"N. Beldiceanu, M. Carlsson and T. Petit, Deriving Filtering Algorithms from Constraint Checkers, inPrinciples and Practice of Constraint Programming (CP'2004), edited by M. Wallace, Springer-Verlag,Lect. Notes Comput. Sci.3258(2004) 107\u2013122. Preprint available as SICS Tech Report T2004-08."},{"key":"R5","unstructured":"N. Beldiceanu, M. Carlsson and J.-X. Rampon,Global Constraint Catalog.Technical Report T2005-08, Swedish Institute of Computer Science (2005)."},{"key":"R6","unstructured":"N. Beldiceanu and T. Petit, Cost Evaluation of Soft Global Constraints, inIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2004), edited by J.-C. R\u00e9gin and M. Rueher, Springer-Verlag,Lect. Notes Comput. Sci.3011(2004) 80\u201395."},{"key":"R7","unstructured":"C. Bessi\u00e8re, E. Hebrard, B. Hnich, Z. K\u0131z\u0131ltan and T. Walsh, Filtering Algorithms for thenvalueConstraint, inInternational Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05),Prague, Czech Republic, edited by R. Bart\u00e1k and M. Milano, Springer-Verlag,Lect. Notes Comput. Sci.3524(2005) 79\u201393"},{"key":"R8","unstructured":"C. Bessi\u00e8re and P. Van Hentenryck, To Be or not to Be... a Global Constraint, inPrinciples and Practice of Constraint Programming (CP'2003), edited by F. Rossi, Springer-Verlag,Lect. Notes Comput. Sci.2833(2003) 789\u2013794."},{"key":"R9","unstructured":"C. Bessi\u00e8re and J.-C. R\u00e9gin, Refining the Basic Constraint Propagation Algorithm, inProceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001, edited by B. Nebel, Morgan Kaufmann (2001) 309\u2013315."},{"key":"R10","unstructured":"G. Dooms, Y. Deville and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, inPrinciples and Practice of Constraint Programming (CP'2005), edited by P. van Beek, Springer-Verlag,Lect. Notes Comput. Sci.3709(2005) 211\u2013225."},{"key":"R11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"R12","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company (1979)."},{"key":"R13","first-page":"241","volume":"16","author":"Han\u00e1k","year":"2003","journal-title":"Scientific Journal Acta Cybernetica"},{"key":"R14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"R15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"Van Hentenryck","year":"1998","journal-title":"J. Logic Programming"},{"key":"R16","unstructured":"I. Katriel and S. Thiel, Fast Bound Consistency for theglobal cardinalityConstraint, inPrinciples and Practice of Constraint Programming (CP'2003), edited by F. Rossi, Springer-Verlag,Lect. Notes Comput. Sci.2833(2003) 437\u2013451."},{"key":"R17","unstructured":"K. Mehlhorn and S. Thiel, Faster Algorithms for Bound-Consistency of thesortednessand thealldifferentConstraint, inPrinciples and Practice of Constraint Programming (CP'2000), edited by R. Dechter, Springer-Verlag,Lect. Notes Comput. Sci.1894(2000) 306\u2013319."},{"key":"R18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Science"},{"key":"R19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0002-9939-1959-0106853-5","volume":"10","author":"Norman","year":"1959","journal-title":"American Math. Soc."},{"key":"R20","unstructured":"G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, inPrinciples and Practice of Constraint Programming (CP'2004)edited by M. Wallace, Springer-Verlag,Lect. Notes Comput. Sci.3258(2004) 482\u2013495."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"T. Petit, J-C. R\u00e9gin and C. Bessi\u00e8re, Meta constraints on violations for over constrained problems, in12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, IEEE Computer Society (2000) 358\u2013365.","DOI":"10.1109\/TAI.2000.889894"},{"key":"R22","unstructured":"T. Petit, J-C. R\u00e9gin and C. Bessi\u00e8re, Specific filtering algorithms for over constrained problems, inPrinciples and Practice of Constraint Programming (CP'2001), edited by T. Walsh, Springer-Verlag,Lect. Notes Comput. Sci.2239(2001) 451\u2013463."},{"key":"R23","unstructured":"C.-G. Quimper, A. L\u00f3pez-Ortiz, P. van Beek and A. Golynski, Improved Algorithms for theglobal cardinalityConstraint, inPrinciples and Practice of Constraint Programming (CP'2004), edited by M. Wallace, Springer-Verlag,Lect. Notes Comput. Sci.3258(2004) 542\u2013556."},{"key":"R24","unstructured":"J.-C. R\u00e9gin, A Filtering Algorithm for Constraints of Difference in CSP, in12th National Conference on Artificial Intelligence (AAAI-94)(1994) 362\u2013367."},{"key":"R25","unstructured":"J.-C. R\u00e9gin, Generalized Arc Consistency forglobal cardinalityConstraint, in14th National Conference on Artificial Intelligence (AAAI-96)(1996) 209\u2013215."},{"key":"R26","unstructured":"J.-C. R\u00e9gin, The SymmetricalldiffConstraint, in16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99)(1999) 420\u2013425."},{"key":"R27","first-page":"436","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"R28","unstructured":"W.-J. van Hoeve, A Hyper-Arc Consistency Algorithm for thesoft alldifferentConstraint, inPrinciples and Practice of Constraint Programming (CP'2004), edited by M. Wallace, Springer-Verlag,Lect. Notes Comput. Sci.3258(2004) 679\u2013689."},{"key":"R29","unstructured":"W.-J. van Hoeve, G. Pesant and L.-M. Rousseau, On global warming: Flow-based soft global constraints, inJournal of Heuristics12(2006) 347\u2013373."},{"key":"R30","unstructured":"N.R. Vempaty, Solving Constraint Satisfaction Problems using Finite State Automata, inNational Conference on Artificial Intelligence (AAAI-92), AAAI Press (1992) 453\u2013458."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007001\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T19:23:50Z","timestamp":1736796230000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":30,"journal-issue":{"issue":"4"},"alternative-id":["ro0652"],"URL":"https:\/\/doi.org\/10.1051\/ro:2007001","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}