Bibliography

[AggounBeldiceanu93]

Kcompulsory_part, sec3.7.120.1, Ksquared_squares, Cbin_packing, Ccumulative, A. Aggoun, N. Beldiceanu, Extending CHIP in order to Solve Complex Scheduling and Placement Problems Mathl. Comput. Modelling 7 17 1993 57–73

[AgrenCarlssonBeldiceanuSbihiTruchetZampelli09]

Cgeost, Clex_chain_greatereq, Clex_chain_less, Clex_chain_lesseq, M. Ågren, M. Carlsson, N. Beldiceanu, M. Sbihi, C. Truchet, S. Zampelli, Six Ways of Integrating Symmetries within Non-Overlapping Constraints Technical report T2009-01 Swedish Institute of Computer Science 2009

[AgrenCarlssonBeldiceanuSbihiTruchetZampelli09a]

KPartridge, M. Ågren, M. Carlsson, N. Beldiceanu, M. Sbihi, C. Truchet, S. Zampelli, Six Ways of Integrating Symmetries within Non-Overlapping Constraints International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09) LNCS 5547 Springer-Verlag W.-J. van Hoeve, J. N. Hooker, 11–25 Pittsburgh, PA, USA 2009

[AhoSagivSzymanskiUllman81]

Cstable_compatibility, A. V. Aho, Y. Sagiv, T. Szymanski, J. D. Ullman, Inferring a tree from lowest common ancestor with an application to the optimization of relational expressions SIAM Journal of Computing 3 10 1981 405–421

[AlthausBockmayrElfKasperJungerMehlhorn02]

Ccircuit, Cpath_from_to, Cstrongly_connected, Ctour, E. Althaus, A. Bockmayr, M. Elf, T. Kasper, M. Jünger, K. Mehlhorn, SCIL—Symbolic Constraints in Integer Linear Programming 10th European Symposium on Algorithms (ESA'02) LNCS 2461 Springer-Verlag 75–87 September 2002

[AlvarezValdesParrenoTamarit05]

Kpallet_loading, R. Alvarez-Valdes, F. Parreno, J. M. Tamarit, A tabu search algorithm for the pallet loading problem OR Spectrum 1 27 2005 43–61

[Amilhastre99]

preface, J. Amilhastre, Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes Ph. D. Thesis Montpellier II University, France 1999 In French

[AppaMagosMourtos04]

Ck_alldifferent, G. Appa, D. Magos, I. Mourtos, LP Relaxations of Multiple alldifferent Predicates First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'04) LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 364–369 Nice, France April 2004

[AppaMagosMourtos05]

Ck_alldifferent, G. Appa, D. Magos, L. Mourtos, On the system of two alldifferent predicates Information Processing Letters 3 94 2005 99–105

[AptWallace07]

sec3.1, sec4.5.2.4, K. R. Apt, M. G. Wallace, Constraint Logic Programming using ECLiPSe Cambridge University Press New York, NY, USA 2007

[ArtiouchineBaptiste05]

Call_min_dist, Call_min_dist, Cdisjunctive, K. Artiouchine, P. Baptiste, Inter-Distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 62–76 2005

[ArtiouchineBaptiste07]

Call_min_dist, K. Artiouchine, P. Baptiste, Arc-B-Consistency of the Inter-Distance Constraint Constraints (Special Issue on Global Constraints) 1 12 2007 3–19

[AsafEranRichterConnorsGreshOrtegaMcinnis10]

Ck_alldifferent, S. Asaf, H. Eran, Y. Richter, D. P. Connors, D. L. Gresh, J. Ortega, M. J. Mcinnis, Applying Constraint Programming to Identification and Assignment of Service Professionals Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 24–37 St Andrews, Scotland 2010

[AsratianDenleyHaggkvist98]

Calldifferent, A. S. Asratian, T. M. J. Denley, R. Häggkvist, Bipartite Graphs and their Applications Cambridge University Press 1998

[Bacchus07]

KSAT, F. Bacchus, GAC Via Unit Propagation Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 133–147 2007

[BaptisteDemassey04]

Ccumulative, P. Baptiste, S. Demassey, Tight LP Bounds for Resource Constrained Project Scheduling OR Spectrum 26 2004 251–262

[BaptisteLePape00]

Ccumulative, P. Baptiste, C. L. Pape, Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems Constraints 1–2 5 2000 119–139

[BaptisteLePapePeridy98]

Cdisjunctive, P. Baptiste, C. L. Pape, L. Peridy, Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints Principles and Practice of Constraint Programming (CP'98) LNCS 1520 Springer-Verlag M. J. Maher, J.-F. Puget, 87–101 1998

[Barnes79]

Kpallet_loading, F. W. Barnes, Packing the maximum number of $m\times n$ tiles in a $p\times q$ rectangle Discrete Mathematics 26 1979 93–100

[BarnierBrisset02]

Ck_alldifferent, N. Barnier, P. Brisset, Graph Coloring for Air Traffic Flow Management 4th Int. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'02) 133–147 Le Croisic, France 2002

[Bartak03]

Kopen_constraint, Kopen_constraint, R. Barták, Dynamic Global Constraints in Backtracking Based Environments Annals of Operations Research 1–4 118 2003 101–119

[BeeriFaginMaierYannakakis83]

KBerge-acyclic_constraint_network, C. Beeri, R. Fagin, D. Maier, M. Yannakakis, On the desirability of acyclic database schemes JACM 30 1983 479–513

[Beldiceanu00]

preface, sec2.4.1, sec4.1, N. Beldiceanu, Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type Principles and Practice of Constraint Programming (CP'2000) LNCS 1894 Springer-Verlag R. Dechter, 52–66 2000 Preprint available as SICS Tech Report T2000-01

[Beldiceanu01]

sec2.4.1, Catmost_nvalue, Cdisjoint, Cmax_n, Cmax_n, Cmaximum, Cmin_n, Cmin_n, Cminimum, Cnclass, Cnequivalence, Cninterval, Cnvalue, N. Beldiceanu, Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family Principles and Practice of Constraint Programming (CP'2001) LNCS 2239 Springer-Verlag T. Walsh, 211–224 2001 Preprint available as SICS Tech Report T2000-10

[Beldiceanu04]

Cint_value_precede_chain, N. Beldiceanu, Deriving Filtering Algorithms from Constraints Checkers Slides presented at the Principles and Practice of Constraint Programming (CP'2004) Conference September 2004

[Beldiceanu98]

Kbusiness_rules, N. Beldiceanu, Parallel Machine Scheduling with Calendar Rules 6th International Workshop on Project Management and Scheduling (PMS'98) Istanbul, Turkey 1998

[BeldiceanuBourreauChanRivreau97]

Ksmallest_rectangle_area, N. Beldiceanu, É. Bourreau, P. Chan, D. Rivreau, Partial Search Strategy in CHIP 2nd international conference on metaheuristics - MIC97 INRIA & PRiSM-Versailles 1–8 July 1997

[BeldiceanuCarlsson01]

Camong_seq, Cchange, Cchange_partition, Crelaxed_sliding_sum, Csliding_sum, Csmooth, N. Beldiceanu, M. Carlsson, Revisiting the cardinality Operator and Introducing the cardinality-path Constraint Family Int. Conf. on Logic Programming (ICLP'2001) LNCS 2237 Springer-Verlag P. Codognet, 59–73 2001 Preprint available as SICS Tech Report T2000-11A

[BeldiceanuCarlsson01sweep]

Ksweep, Cdiffn, N. Beldiceanu, M. Carlsson, Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraints Principles and Practice of Constraint Programming (CP'2001) LNCS 2239 Springer-Verlag T. Walsh, 377–391 2001 Preprint available as SICS Tech Report T2001-13

[BeldiceanuCarlsson02a]

Ccumulatives, Ccumulatives, N. Beldiceanu, M. Carlsson, A New Multi-Resource cumulatives Constraint with Negative Heights Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 63–79 2002 Preprint available as SICS Tech Report T2001-11

[BeldiceanuCarlsson02b]

Clex_greater, Clex_greatereq, Clex_less, Clex_lesseq, M. Carlsson, N. Beldiceanu, Revisiting the Lexicographic Ordering Constraint Technical report T2002-17 Swedish Institute of Computer Science 2002

[BeldiceanuCarlsson02c]

Clex_between, Clex_between, Clex_chain_greater, Clex_chain_greatereq, Clex_chain_less, Clex_chain_less, Clex_chain_lesseq, Clex_chain_lesseq, M. Carlsson, N. Beldiceanu, Arc-Consistency for a Chain of Lexicographic Ordering Constraints Technical report T2002-18 Swedish Institute of Computer Science 2002

[BeldiceanuCarlssonFlenerPearson12]

Kreified_constraint, N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson, On the Reification of Global Constraints Technical report T2012-02 Swedish Institute of Computer Science 2012

[BeldiceanuCarlssonFlenerPearson13]

sec2.1.6, N. Beldiceanu, M. Carlsson, P. Flener, J. Pearson, On the reification of global constraints Constraints 1 18 2013 1–6

[BeldiceanuCarlssonPetit04]

preface, sec2, sec2.4, Kautomaton_without_counters, sec3.7.226, N. Beldiceanu, M. Carlsson, T. Petit, Deriving Filtering Algorithms from Constraint Checkers Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 107–122 2004 Preprint available as SICS Tech Report T2004-08

[BeldiceanuCarlssonPoder08]

Kcumulative_longest_hole_problems, sec3.7.120.1, Ksquared_squares, Ccumulative, N. Beldiceanu, M. Carlsson, E. Poder, New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08) LNCS 5015 Springer-Verlag L. Perron, M. A. Trick, 21–35 Paris, France May 2008

[BeldiceanuCarlssonPoderSadekTruchet07]

Kpentomino, Ksquared_squares, Ksweep, Cgeost, Cgeost_time, Clex_alldifferent, Cnon_overlap_sboxes, N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, C. Truchet, A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 180–194 2007

[BeldiceanuCarlssonRampon05]

preface, N. Beldiceanu, M. Carlsson, J.-X. Rampon, Global Constraint Catalog Technical report T2005-08 Swedish Institute of Computer Science 2005 Available at ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--2005-08--SE.pdf

[BeldiceanuCarlssonSoftSweep01]

Ksweep, N. Beldiceanu, M. Carlsson, Sweep as a Generic Pruning Technique Applied to Constraint Relaxation CP'01 3rd Workshop on Soft Constraints (Soft'01) 43–55 Paphos, Cyprus 2001

[BeldiceanuCarlssonThiel02]

Catmost_nvalue, Cdisjoint, Cnclass, Cnequivalence, Cninterval, Cnvalue, Cnvalue, Csum_of_weights_of_distinct_values, N. Beldiceanu, M. Carlsson, S. Thiel, Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint Technical report T2002-14 Swedish Institute of Computer Science 2002

[BeldiceanuContejean94]

sec2.4.1, Camong, Camong_low_up, Camong_seq, Ccycle, Cderangement, Cdiffn, Cdiffn, Csymmetric_alldifferent, Ctemporal_path, N. Beldiceanu, E. Contejean, Introducing Global Constraints in CHIP Mathl. Comput. Modelling 12 20 1994 97–123

[BeldiceanuFlenerLorca05]

Ctree, Ctree, N. Beldiceanu, P. Flener, X. Lorca, The tree Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05) LNCS 3524 Springer-Verlag R. Barták, M. Milano, 64–78 Prague, Czech Republic May 2005

[BeldiceanuFlenerLorca06]

Cstable_compatibility, N. Beldiceanu, P. Flener, X. Lorca, Combining tree partitioning, precedence, incomparability, and degree constraints, with an application to phylogenetic and ordered-path problems Technical report Technical Report 2006-020 Department of Information Technology, Uppsala University, Sweden 2006 Available at http://www.it.uu.se/research/publications/reports/2006-020

[BeldiceanuGuoThiel01]

Kcompulsory_part, Kcompulsory_part, Cdiffn, Cdiffn, N. Beldiceanu, Q. Guo, S. Thiel, Non-overlapping Constraints between Convex Polytopes Principles and Practice of Constraint Programming (CP'2001) LNCS 2239 Springer-Verlag T. Walsh, 392–407 2001 Preprint available as SICS Tech Report T2001-12

[BeldiceanuHermenierLorcaPetit10]

Cincreasing_nvalue, N. Beldiceanu, F. Hermenier, X. Lorca, T. Petit, The increasing_nvalue Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 25–39 Bologna, Italy 2010

[BeldiceanuKatrielLorca06]

Cproper_forest, Cproper_forest, N. Beldiceanu, I. Katriel, X. Lorca, Undirected Forest Constraints International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 29–43 Cork, Ireland May/June 2006

[BeldiceanuKatrielThiel04a]

Csame, Csame_and_global_cardinality_low_up, Cused_by, Cused_by, N. Beldiceanu, I. Katriel, S. Thiel, Filtering Algorithms for the Same and UsedBy Constraints Technical report 2004/1/001 MPI 2004

[BeldiceanuKatrielThiel04b]

sec2, Csame, Csame, Csame_and_global_cardinality_low_up, N. Beldiceanu, I. Katriel, S. Thiel, Filtering Algorithms for the Same Constraint Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'04) LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 65–79 2004

[BeldiceanuKatrielThiel05]

Csame, Cused_by, N. Beldiceanu, I. Katriel, S. Thiel, Filtering Algorithms for the Same and UsedBy Constraints Archives of Control Sciences, Special Issue on constraint programming for decision and control 2005 To appear

[BeldiceanuKatrielThiel05b]

Csame_and_global_cardinality, Csame_and_global_cardinality_low_up, N. Beldiceanu, I. Katriel, S. Thiel, GCC-like Restrictions on the Same Constraint Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004; Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers LNCS 3419 Springer-Verlag B. Faltings, A. Petcu, F. Fages, F. Rossi, 1–11 2005

[BeldiceanuPetit04]

sec2, N. Beldiceanu, T. Petit, Cost Evaluation of Soft Global Constraints Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 80–95 2004

[BeldiceanuPetitRochart06]

Cconnect_points, N. Beldiceanu, T. Petit, G. Rochart, Bounds of parameters for global constraints RAIRO Operations Research 4 40 2006 327–353

[BeldiceanuPoder04]

Cperiod, Cperiod_except_0, N. Beldiceanu, E. Poder, The Period Constraint Int. Conf. on Logic Programming (ICLP'2004) LNCS Springer-Verlag B. Demoen, 2004

[BeldiceanuPoderPMS04]

sec3.2, N. Beldiceanu, E. Poder, Cumulated Profiles of Minimum and Maximum Resource Utilisation Ninth Int. Conf. on Project Management and Scheduling Nancy, France April 2004

[BeldiceanuR00]

preface, preface, sec4.1, Ccalendar, 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

[BeldiceanuSimonis11]

preface, preface, sec2.1.7, N. Beldiceanu, H. Simonis, A Constraint Seeker: Finding and Ranking Global Constraints from Examples Principles and Practice of Constraint Programming (CP'2011) LNCS 6876 Springer-Verlag J. H. Lee, 12–25 Perugia, Italy 2011

[BeldiceanuSimonis12]

preface, preface, N. Beldiceanu, H. Simonis, A Model Seeker: Extracting Global Constraint Models from Positive Examples Principles and Practice of Constraint Programming (CP'2012) LNCS 7514 Springer-Verlag M. Milano, 141–157 Quebec City, Canada 2012

[Berge70]

sec2, sec2.3.2.4, sec2.3.2.4, Calldifferent, C. Berge, Graphes Dunod 1970 In French

[Berge87]

sec2.3.2.3, sec2.3.2.3, KBerge-acyclic_constraint_network, C. Berge, Hypergraphes, Combinatoire des ensembles finis Gauthier-Villars 1987 In French

[Bessiere06]

Karc-consistency, Karc-consistency, Kbound-consistency, Kbound-consistency, C. Bessière, Constraint Propagation F. Rossi, P. van Beek, T. Walsh, Handbook of Constraint Programming Elsevier 2006 3

[BessiereColettaPetit05]

sec2, C. Bessière, R. Coletta, T. Petit, Acquiring Parameters of Implied Global Constraints Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 747–751 2005

[BessiereHebrardHnichKiziltanWalsh05]

sec4.3.4.3, Catleast_nvalue, Catleast_nvalue, Catmost_nvalue, Catmost_nvalue, Catmost_nvalue, Catmost_nvalue, Cnvalue, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, Filtering Algorithms for the nvalue Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'05) LNCS 3524 Springer-Verlag R. Barták, M. Milano, 79–93 Prague, Czech Republic May 2005

[BessiereHebrardHnichKiziltanWalsh05ERCIM]

Camong, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, Among, common and disjoint Constraints Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2005) M. Carlsson, F. Fages, B. Hnich, F. Rossi, 223–235 June 2005

[BessiereHebrardHnichKiziltanWalsh05IJCAI]

sec3.2, Croots, Croots, Cuses, Cuses, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, The range and roots Constraints: Specifying Counting and Occurrence Problems 19th Int. Joint Conf. on Artificial Intelligence (IJCAI-05) 60–65 2005

[BessiereHebrardHnichKiziltanWalsh06]

sec3.2, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, The Range Constraint: Algorithms and Implementation International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 59–73 Cork, Ireland May/June 2006

[BessiereHebrardHnichKiziltanWalsh06CP]

Croots, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, The Roots Constraint Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 75–90 Nantes, France 2006

[BessiereHebrardHnichKiziltanWalsh06ERCIM]

Camong, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, Among, common and disjoint Constraints Recent Advances in Constraints, Joint ERCIM/Colognet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP05; Uppsala, Sweden, June 2005; Revised Selected and Invited Papers LNAI 3978 Springer-Verlag B. Hnich, M. Carlsson, F. Fages, F. Rossi, 28–43 2006

[BessiereHebrardHnichKiziltanWalsh09]

Croots, C. Bessière, E. Hebrard, B. Hnich, Z. Kızıltan, T. Walsh, Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints Artificial Intelligence 11 173 2009 1054–1078

[BessiereHebrardHnichWalsh04]

Catmost1, C. Bessière, E. Hebrard, B. Hnich, T. Walsh, Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 138–152 2004

[BessiereHebrardHnichWalsh04a]

Ccommon, Cglobal_cardinality, C. Bessière, E. Hebrard, B. Hnich, T. Walsh, The Tractability of Global Constraints Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 716–720 2004

[BessiereHebrardHnichWalshO4]

Catmost_nvalue, Cnvalue, C. Bessière, E. Hebrard, B. Hnich, T. Walsh, The Complexity of Global Constraints 19th National Conference on Artificial Intelligence (AAAI'04) AAAI Press D. L. McGuinness, G. Ferguson, 112–117 2004

[BessiereKatsirelosNarodytskaQuimperWalsh09IJCAI]

Calldifferent, Cglobal_cardinality_low_up, C. Bessière, G. Katsirelos, N. Narodytska, C.-G. Quimper, T. Walsh, Decompositions of all different, global cardinality and related constraints 21th Int. Joint Conf. on Artificial Intelligence (IJCAI-09) 2009

[BessiereKatsirelosNarodytskaQuimperWalsh10]

Kbound-consistency, Ck_alldifferent, C. Bessière, G. Katsirelos, N. Narodytska, C.-G. Quimper, T. Walsh, Propagating Conjunctions of alldifferent Constraints 25th National Conference on Artificial Intelligence (AAAI'10) AAAI Press 1-6 July 2010

[BessiereKatsirelosNarodytskaQuimperWalsh10CP]

Cnvalue, C. Bessière, G. Katsirelos, N. Narodytska, C.-G. Quimper, T. Walsh, Decomposition of the nvalue Constraint Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 114–128 St Andrews, Scotland 2010

[BessiereKatsirelosNarodytskaWalsh09]

Calldifferent, C. Bessière, G. Katsirelos, N. Narodytska, T. Walsh, Circuit Complexity and Decompositions of Global Constraints 21th Int. Joint Conf. on Artificial Intelligence (IJCAI-09) 412–418 2009

[BessiereNarodytskaQuimperWalsh11]

Calldifferent, C. Bessière, N. Narodytska, C.-G. Quimper, T. Walsh, The alldifferent Constraint with Precedences International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'11) LNCS 6697 Springer-Verlag T. Achterberg, J. C. Beck, 36–52 Berlin, Germany 2011

[BinindaEmondsGittlemanSteel02]

Cstable_compatibility, O. R. Bininda-Emonds, J. L. Gittleman, M. A. Steel, The (super)tree of life: Procedures, problems, and prospects Annual Reviews of Ecological Systems 33 2002 265–289

[Biro90]

Cdiffn, M. Biró, Object-oriented interaction in resource constrained scheduling Information Processing Letters 2 36 1990 65–67

[BodirskyKutz07]

Cstable_compatibility, M. Bodirsky, M. Kutz, Determining the Consistency of Partial Tree Descriptions Artificial Intelligence 2–3 171 2007 185–196

[Bohlin04]

sec2, M. Bohlin, Design and Implementation of a Graph-Based Constraint Model for Local Search Licentiate Thesis 27 Mälardalen University 2004

[BordeauxMonfroy03]

sec2, L. Bordeaux, É. Monfroy, Extraction de programmes à partir de spécifications en logique existentielle du second ordre par compilation de connaissances Programmation en logique avec contraintes, JFPLC 2003 Revue des sciences et technologies de l'information Lavoisier 189–202 June 2003 In French

[BourdaisGalinierPesant03]

sec2.4.1, Cglobal_cardinality, Cin_relation, Cpattern, Cpattern, S. Bourdais, P. Galinier, G. Pesant, HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care Principles and Practice of Constraint Programming (CP'2003) LNCS 2833 Springer-Verlag F. Rossi, 153–167 2003

[Bourreau99]

Kbusiness_rules, Ccycle, Ccycle_card_on_path, Ccycle_resource, Ccycle_resource, Ccycle_resource, É. Bourreau, Traitement de contraintes sur les graphes en programmation par contraintes Ph. D. Thesis Paris 13 University, France March 1999 In French

[BouwkampDuijvestijn92]

Ksquared_squares, Cdiffn, C. J. Bouwkamp, A. J. W. Duijvestijn, Catalogue of Simple Perfect Squared Squares of orders 21 through 25 Technical report EUT Report 92-WSK-03 Eindhoven University of Technology, Faculty of Mathematics and Computing Science, The Netherlands November 1992

[Brand09]

Csum_of_increments, Csum_of_increments, Csum_of_increments, S. Brand, The Sum-of-Increments Constraint in the Consecutive-Ones Matrix Decomposition Problem Proceedings of the 2009 ACM Symposium on Applied Computing (SAC) S. Y. Shin, S. Ossowski, 1417-1418 Honolulu, Hawaii, USA 2009

[BrandNarodytskaQuimperStuckeyWalsh07]

Camong_seq, S. Brand, N. Narodytska, C.-G. Quimper, P. J. Stuckey, T. Walsh, Encodings of the sequence Constraint Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 210–224 2007

[BronKerbosch73]

Kmaximum_clique, Call_min_dist, Calldifferent, Cclique, Cdisjunctive, C. Bron, J. Kerbosch, Finding All Cliques of an Undirected Graph Communications of the ACM 9 16 September 1973 575–577

[CambazardSullivan10]

Cbin_packing, H. Cambazard, B. O'Sullivan, Propagating the Bin Packing Constraint Using Linear Programming Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 129–136 St Andrews, Scotland 2010

[CapraraLodiMartelloMonaci06]

Ksmallest_rectangle_area, A. Caprara, A. Lodi, S. Martello, M. Monaci, Packing into the smallest square: Worst-case analysis of lower bounds Discrete Optimization 3 2006 317–326

[Carlier82]

Cdisjunctive, J. Carlier, The one-machine sequencing problem European Journal of Operational Research 11 1982 42–47

[CarlierPinson88]

Cdisjunctive, J. Carlier, E. Pinson, Une méthode arborescente pour optimiser la durée d'un job-shop Technical report ISSN/0294-2755 Institut de Mathématiques Appliquées, UCO, Angers 1988 Les Cahiers de L'I.M.A., In French

[CarlierPinson90]

Cdisjunctive, Cdisjunctive, J. Carlier, E. Pinson, A Practical Use of Jackson's Preemptive Schedule for Solving the job-shop Problem Annals of Operations Research 26 1990 269–287

[Carlsson06]

sec3.2, M. Carlsson, Filtering for the case constraint. Talk given at Advanced School on Global Constraints. Samos, Greece 2006

[CarlssonBeldiceanu04]

Cnext_greater_element, M. Carlsson, N. Beldiceanu, Dispensation Order Generation for Pyrosequencing Proceedings of Proceedings of the Second Asia Pacific Bioinformatics Conference (APBC2004) 29 Australian Computer Society Y.-P. P. Chen, 327–332 Dunedin, New Zealand January 2004

[CarlssonBeldiceanuMartin08]

preface, sec1, Kbusiness_rules, Klogic, Ksweep, sec4.5.1, M. Carlsson, N. Beldiceanu, J. Martin, A Geometric Constraint over $k$-Dimensional Objects and Shapes Subject to Business Rules Principles and Practice of Constraint Programming (CP'2008) LNCS 5202 Springer-Verlag P. J. Stuckey, 220–234 2008

[CarlssonOttossonCarlson97]

sec3.1, sec3.3.4, M. Carlsson, G. Ottosson, B. Carlson, An Open-Ended Finite Domain Constraint Solver Programming Languages: Implementations, Logics, and Programming (PLILP'97) LNCS 1292 Springer-Verlag H. Glaser, P. Hartel, H. Kuchen, 191–206 Southampton 1997

[Carvalho02]

Cbin_packing, J. M. V. Carvalho, LP models for bin packing and cutting stock problems European Journal of Operational Research 2 141 2002 253–273

[Carvalho99]

Cbin_packing, J. M. V. Carvalho, Exact solution of bin-packing problems using column generation and branch-and-bound Annals of Operations Research 86 1999 629–659

[CaseauLaburthe96b]

Ccumulative, Y. Caseau, F. Laburthe, Cumulative Scheduling with Task Intervals Joint International Conference and Symposium on Logic Programming (JICSLP'96) MIT Press 1996

[CaseauLaburthe97]

sec3.2, Y. Caseau, F. Laburthe, Solving Small TSPs with Constraints Fourteenth International Conference on Logic Programming (ICLP'97) MIT Press L. Naish, 316–330 1997

[Cayley89]

Cproper_forest, A. Cayley, A theorem on trees Quart. J. Math. 23 1889 376–378

[ChabertBeldiceanu10]

Ksweep, G. Chabert, N. Beldiceanu, Sweeping with Continous Domains Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 137–151 St Andrews, Scotland 2010

[ChabertDemassey12]

Camong, G. Chabert, S. Demassey, The Conjunction of Interval Among Constraints International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) LNCS 7298 Springer-Verlag N. Beldiceanu, N. Jussien, É. Pinson, 113–128 Nantes, France 2012

[ChabertJaulinLorca09]

KSLAM_problem, Cnvector, G. Chabert, L. Jaulin, X. Lorca, A Constraint on the Number of Distinct Vectors with Application to Localization Principles and Practice of Constraint Programming (CP'2009) LNCS 5732 Springer-Verlag I. P. Gent, 196–210 2009

[ChabertLorca09]

Cnvector, G. Chabert, X. Lorca, On the Clique Partition of Rectangle Graphs Technical report 09-03-INFO École des Mines de Nantes 2009

[Chang87]

KCostas_arrays, W. Chang, A Remark on the Definition of Costas Arrays Proceedings of the IEEE 4 75 April 1987 522–523

[Charman95]

Kfloor_planning_problem, P. Charman, Gestion des contraintes géométriques pour l'aide à l'aménagement spatial Ph. D. Thesis École Nationale des Ponts et Chaussées, France November 1995 In French

[ChengYap05]

sec3.2, K. C. K. Cheng, R. H. C. Yap, Ad-hoc Global Constraints for Life Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 182–195 2005

[ChengYap06]

sec3.2, K. C. K. Cheng, R. H. C. Yap, Applying Ad-hoc Global Constraints with the case Constraint to Still-Life Constraints 2–3 11 2006 91–114

[ChuGarciadelaBandaStuckey10]

sec2, G. Chu, M. J. G. de la Banda, P. J. Stuckey, Automatically Exploiting Subproblem Equivalence in Constraint Programming International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 71–86 Bologna, Italy 2010

[Chvatal73]

Ccircuit, V. Chvátal, Tough graphs and hamiltonian circuits Discrete Mathematics 5 1973 215–228

[ClautiauxCarlierMoukrim06]

Ktwo_dimensional_orthogonal_packing, F. Clautiaux, J. Carlier, A. Moukrim, A New Exact Method for the Orthogonal Packing Problem European Journal of Operational Research 3 183 2007 1196–1211

[CoffmanGareyJohnson84]

Cbin_packing, E. G. Coffman, M. R. Garey, D. S. Johnson, Approximation algorithms for bin packing - an updated survey Algorithms Design for Computer System Design Springer-Verlag, New York G. Ausiello, M. Lucertini, P. Serafini, 49–106 1984

[CohenJeavonsJeffersonPetrieSmith06]

sec2.2.5, sec3.6.17, D. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, B. Smith, Symmetry Definitions for Constraint Satisfaction Problems Constraints 2-3 11 2006 115–137

[CormenLeisersonRivest90]

Ccrossing, Ccrossing, T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to algorithms Fifteenth MIT Press 1990

[Costa94]

Calldifferent, M.-C. Costa, Persistency in maximum cardinality bipartite matchings Operation Research Letters 15 1994 143–149

[Cosytec97]

sec3.2, Csoft_cumulative, CHIP Reference Manual COSYTEC Release 5.1 1997

[CoteGendronRousseau07]

preface, sec3.2, Klinear_programming, M.-C. Coté, B. Gendron, L.-M. Rousseau, Modeling the Regular Constraint with Integer Programming International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07) LNCS 4150 Springer-Verlag P. Van Hentenryck, L. Wolsey, 29–43 Brussels, Belgium May 2007

[Cousin93]

Cinterval_and_count, X. Cousin, Application of Constraint Logic Programming on Timetable Problem Ph. D. Thesis Rennes I University, France June 1993 In French

[CousotCousot77]

Kabstract_interpretation, P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints Proceedings of Symposium on Principles of Programming Languages (POPL'77) ACM Press 238–252 1977

[CroftFalconerGuy91]

Ksquared_squares, H. T. Croft, K. J. Falconer, R. K. Guy, Unsolved Problems in Geometry Springer-Verlag New York, Berlin 1991

[Cymer12]

Calldifferent, Calldifferent_except_0, Ccorrespondence, Cinverse, Csame, Csoft_alldifferent_var, Csoft_same_var, Csoft_used_by_var, Csymmetric_cardinality, Cused_by, R. Cymer, Dulmage-Mendelsohn Canonical Decomposition as a generic pruning technique Constraints 3 17 2012 234–272

[Cymer13]

Csymmetric_alldifferent, Csymmetric_alldifferent_except_0, Csymmetric_alldifferent_loop, Ctour, R. Cymer, Gallai-Edmonds decomposition as a pruning technique Central European Journal of Operations Research 2013

[CymerPhD13]

Calldifferent, Ccorrespondence, Cinverse, Csame, Csoft_alldifferent_var, Csoft_same_var, Csoft_used_by_var, Csymmetric_alldifferent, Csymmetric_alldifferent_except_0, Csymmetric_alldifferent_loop, Csymmetric_cardinality, Ctour, Cused_by, R. Cymer, Applications of Matching Theory in Constraint Programming Ph. D. Thesis Hannover University, Germany 2013

[DawandeKalagnanamSethuraman98]

Ccoloured_cumulative, M. Dawande, J. Kalagnanam, J. Sethuraman, Variable Sized Bin Packing with Color Constraints Technical report RC21350 IBM Research Report 1998

[DeClercq12]

Csoft_cumulative, A. D. Clercq, Ordonnancement cumulatif avec dépassements de capacités: Contrainte globale et décompositions Ph. D. Thesis École des Mines de Nantes, France 2012 In French

[Dechter89]

Kalpha-acyclic_constraint_networkNb2, R. Dechter, J. Pearl, Tree Clustering for Constraint Networks Artificial Intelligence 3 38 1989 353–366

[DechterPearl87]

sec2.3.1, R. Dechter, J. Pearl, Network-Based Heuristics for Constraint-Satisfaction Problems Artificial Intelligence 1 34 1987 1–38

[DechterPearl88]

Kheuristics_and_berge_acyclic_contraint_network, R. Dechter, J. Pearl, Network-Based Heuristics for Constraint-Satisfaction Problems Artificial Intelligence 34 1988 1–38

[DemasseyPesantRousseau06]

sec3.2, S. Demassey, G. Pesant, L.-M. Rousseau, A Cost-Regular based hybrid column generation approach Constraints 4 11 2006 Special issue following CPAIOR'05

[DenmatGotliebDucasse07]

Cgcd, Cgcd, Cpower, Cpower, T. Denmat, A. Gotlieb, M. Ducassé, An Abstract Interpretation Model Based Combinator for Modelling While Loops in Constraint Programming Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 241–255 2007

[Deo76]

Ccircuit, N. Deo, Note on Hopcroft and Tarjan's Planarity Algorithm Journal of the Association for Computing Machinery 1 23 January 1976 74–75

[DiBattistaEadesTamassiaTollis99]

Ctwo_layer_edge_crossing, G. D. Battista, P. Eades, R. Tamassia, I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs Prentice-Hall Englewood Cliffs, NJ 1999

[DiedrichJansenSchwarzTrystram09]

Kscheduling_with_machine_choice_calendars_and_preemption, F. Diedrich, K. Jansen, U. M. Schwarz, D. Trystram, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability Algorithmics LNCS 5515 Springer-Verlag J. Lerner, D. Wagner, K. A. Zweig, 50–64 2009

[DincbasSimonis91]

Ck_alldifferent, M. Dincbas, H. Simonis, APACHE - A Constraint Based, Automated Stand Allocation System Advanced Software Technology in Air Transport (ASTAIR'91) Royal Aeronautical Society 267–282 London, UK 1991

[DincbasVanHentenryckSimonisAggounGrafBerthier88]

sec3.1, M. Dincbas, P. Van Hentenryck, H. Simonis, T. G. A. Aggoun, F. Berthier, The Constraint Logic Programming Language CHIP Int. Conf. on Fifth Generation Computer Systems (FGCS'88) 693–702 Tokyo, Japan 1988

[DongenLecoutreRoussel08]

sec4.5.2.1, M. R. C. van Dongen, C. Lecoutre, O. Roussel, Results of the Second CSP Solver Competition Proceedings of the Second International CSP Solver Competition M. R. C. van Dongen, C. Lecoutre, O. Roussel, 1–10 2008

[Dooms06]

sec2.2.1, sec2.2.2, sec3.1, Cbipartite, Cbipartite, Cconnected, Cconnected, Cdag, Cdag, Cstrongly_connected, Csymmetric, Csymmetric, G. Dooms, The CP(Graph) Computation Domain in Constraint Programming Ph. D. Thesis University Catholic of Louvain, Belgium September 2006

[DoomsKatriel06]

sec3.2, Ctree, G. Dooms, I. Katriel, The minimum spanning tree Constraint Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 152–166 Nantes, France 2006

[Dowsland84]

Kpallet_loading, K. A. Dowsland, The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems Journal of the Operational Research Society 35 1984 895–905

[Dowsland85]

Kpallet_loading, K. A. Dowsland, Determining an upper bound for a class of rectangular packing problems Computers & operations research 22 12 1985 201–205

[DuBoisberrangerGardyLorcaTruchet13]

KDFS-bottleneck, J. D. Boisberranger, D. Gardy, X. Lorca, C. Truchet, When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013 SIAM M. E. Nebel, W. Szpankowski, 80–90 2013

[Dudeney19]

sec2, H. E. Dudeney, The Canterbury Puzzles Thomas Nelson & Sons, New York 1919

[Duijvestijn78]

Ksquared_squares, Ksquared_squares, A. J. W. Duijvestijn, Simple Perfect Squared Square of Lowest Order Journal of Combinatorial Theory Series B 25 1978 555–558

[DulmageMendelsohn58]

Calldifferent, Calldifferent_except_0, Ccorrespondence, Cinverse, Csymmetric_cardinality, A. L. Dulmage, N. S. Mendelsohn, Coverings of bipartite graphs Canadian Journal of Mathematics 4 10 1958 517–534

[ECLiPSe03]

sec3.1, A. M. Cheadle, W. Harvey, A. J. Sadler, J. Schimpf, K. Shen, M. G. Wallace, ECLiPSe: An Introduction Technical report 03-1 IC-Parc, Imperial College London 2003

[Edmonds65]

Csymmetric_alldifferent_except_0, Csymmetric_alldifferent_loop, J. Edmonds, Paths, trees and flowers Canadian Journal of Mathematics 17 1965 449–467

[ElbassioniKatrielKutzMahajan05]

Ck_alldifferent, Ck_same, Ck_same, Ck_used_by, K. M. Elbassioni, M. K. I. Katriel, M. Mahajan, On Systems of alldifferent Constraints Unpublished Max-Planck-Institut für Informatik 2005

[ElbassioniKatrielKutzMahajan05b]

Ck_alldifferent, K. M. Elbassioni, I. Katriel, M. Kutz, M. Mahajan, Simultaneous Matchings Algorithms and Computation, 16th International Symposium, (ISAAC 2005) LNCS 3827 Springer-Verlag X. Deng, D.-Z. Du, 106–115 2005

[EppsteinStrash11]

Calldifferent, D. Eppstein, D. Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs 10th International Symposium on Experimental Algorithms (SEA 2011) LNCS 6630 Springer-Verlag P. M. Pardalos, S. Rebennack, 364–375 Kolimpari, Chania, Crete, Greece 2011

[ErschlerLopez90]

Ccumulative, J. Erschler, P. Lopez, Energy-Based Approach for Task Scheduling under Time and Resources Constraints 2nd International Workshop on Project Management and Scheduling 115–121 Compiégne, France June 1990

[Euler59]

sec2, L. Euler, Solution d'une question curieuse qui ne parait soumise à aucune analyse Mém. Acad. Sci. Berlin 15 1759 310–337

[FagesLal03]

Ccutset, Ccutset, Ccutset, F. Fages, A. Lal, A Global Constraint for Cutset Problems 5th Int. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'03) Montréal, Canada 2003

[FagesLorca11]

Ctree, J.-G. Fages, X. Lorca, Revisiting the tree Constraint Principles and Practice of Constraint Programming (CP'2011) LNCS 6876 Springer-Verlag J. H. Lee, 271–285 Perugia, Italy 2011

[Fagin83]

Kalpha-acyclic_constraint_networkNb2, R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes JACM 30 July 1983 514–550

[Fahle02]

Cclique, Cclique, T. Fahle, Cost Based Filtering vs. Upper Bounds for Maximum Clique 4th Int. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'02) Le Croisic, France 2002

[FalkowskiSchmitz86]

Kn-queens, B.-J. Falkowski, L. Schmitz, A note on the queens' problem Information Processing Letters 1 23 1986 39–46

[FaltingsMachoGonzalez02]

Kopen_constraint, B. Faltings, S. Macho-Gonzalez, Open Constraint Satisfaction Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 356–370 2002

[FaltingsMachoGonzalez05]

Kopen_constraint, B. Faltings, S. Macho-Gonzalez, Open Constraint Programming Artificial Intelligence 1–2 161 2005 181–208

[FavaronMaheoSacle88]

sec4.3.4.3, O. Favaron, M. Mahéo, J.-F. Saclé, On the residue of a graph J. Graph Theory 15 1991 39–64

[FeketeSchepersVeen07]

KSAT, S. P. Fekete, J. Schepers, J. van der Veen, An Exact Algorithm for Higher-Dimensional Orthogonal Packing Operations Research 3 55 2007 569–587

[FestaPardalosResende99]

Kminimum_feedback_vertex_set, P. Festa, P. M. Pardalos, M. G. C. Resende, Feedback set problems Handbook of Combinatorial Optimization, Supplement Vol. A Kluwer Academic Publishers D. Du, P. M. Pardalos, 209–258 1999

[FinkVoss99]

Kpattern_sequencing, Ccumulative_convex, A. Fink, S. Voss, Applications of modern heuristic search methods to pattern sequencing problems Computers and Operations Research 26 1999 17–34

[FlammHofackerStadler99]

Csequence_folding, C. Flamm, I. L. Hofacker, P. F. Stadler, RNA in silico: The computational biology of RNA secondary structures Adv. Complex Syst. 2 1999 5–90

[FlenerFrischHnichKiziltanMiguelPearsonWalsh02]

Callperm, Clex2, Clex_lesseq_allperm, Cstrict_lex2, P. Flener, A. M. Frisch, B. Hnich, Z. Kızıltan, I. Miguel, J. Pearson, T. Walsh, Breaking Row and Column Symmetries in Matrix Models Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 462–476 2002

[FlenerPearsonSellmannVanHentenryckAgren09]

sec2.2.5, sec3.6.17, P. Flener, J. Pearson, M. Sellmann, P. Van Hentenryck, M. Ågren, Dynamic structural symmetry breaking for constraint satisfaction problems Constraints 4 14 2009 506–538

[Focacci01]

Cdiscrepancy, Cdiscrepancy, F. Focacci, Solving Combinatorial Optimization Problems in Constraint Programming Ph. D. Thesis Ferrara University, Italy 2001

[FocacciLodiMilano99]

Cminimum_weight_alldifferent, F. Focacci, A. Lodi, M. Milano, Cost-Based Domain Filtering Principles and Practice of Constraint Programming (CP'99) LNCS 1713 Springer-Verlag 189–203 1999

[FordFulkerson62]

Ccolored_matrix, L. R. F. Jr., D. R. Fulkerson, Flows in Networks Princeton University Press 1962

[Freuder82]

Kheuristics_and_berge_acyclic_contraint_network, E. C. Freuder, A Sufficient Condition for Backtrack-Free Search J. ACM 1 29 1982 24–32

[FriHniKizMigWal03]

Clex_greater, Clex_greatereq, Clex_less, Clex_lesseq, A. M. Frisch, B. Hnich, Z. Kızıltan, I. Miguel, T. Walsh, Multiset Ordering Constraints 18th Int. Joint Conf. on Artificial Intelligence (IJCAI-2003) 2003

[FrischHnichKiziltanMiguelWalsh02]

sec2.4.1, Clex_greater, Clex_greater, Clex_greatereq, Clex_greatereq, Clex_less, Clex_less, Clex_lesseq, Clex_lesseq, A. M. Frisch, B. Hnich, Z. Kızıltan, I. Miguel, T. Walsh, Global Constraints for Lexicographic Orderings Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 93–108 2002

[Fruhwirth06]

Clex_greater, Clex_greatereq, Clex_less, Clex_lesseq, T. Frühwirth, Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains Recent Advances in Constraints, Joint ERCIM/Colognet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP05; Uppsala, Sweden, June 2005; Revised Selected and Invited Papers LNAI 3978 Springer-Verlag B. Hnich, M. Carlsson, F. Fages, F. Rossi, 14–28 2006

[Fruhwirth98]

Clex_greater, Clex_greatereq, Clex_less, Clex_lesseq, T. Frühwirth, Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming Journal of Logic Programming 1–3 37 October 1998 95–138

[Frutos97]

Call_differ_from_at_least_k_pos, Cdiffer_from_at_least_k_pos, A. G. Frutos, Q. Liu, A. J. Thiel, A. M. W. Sanner, A. E. Condon, L. M. Smith, R. M. Corn, Demonstration of a Word Design Strategy for DNA Computing on Surfaces Nucleic Acids Research 25 1997 4748–4757

[Gale57]

Csame, D. Gale, A theorem on flows in networks Pacific J. Math. 7 1957 1073–1082

[Gallai63]

Csymmetric_alldifferent_except_0, Csymmetric_alldifferent_loop, T. Gallai, Kritische Graphen II Publ. Math. Inst. Hungar. Acad. Sci. 8 1963 373–395

[Gambini99a]

Cdiffn, I. Gambini, Quant aux carrés carrelés Ph. D. Thesis Aix-Marseille II University, France December 1999 In French

[Gambini99b]

Cdiffn, I. Gambini, A Method for Cutting Squares into Distinct Squares Discrete Applied Mathematics 1–2 98 1999 65–80

[GansnerNorth00]

sec3.4, sec4.5.2.2, E. R. Gansner, S. C. North, An open graph visualization system and its applications to software engineering Softw., Pract. Exper. 11 30 2000 1203–1233

[GareyJohnson79]

Cdom_reachability, M. R. Garey, D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness W.H.Freeman and co. San Francisco 1979

[GareyJohnson83]

Ctwo_layer_edge_crossing, M. R. Garey, D. S. Johnson, Crossing number is NP-complete SIAM Journal on Algebraic Discrete Methods 4 1983 312–316

[GareyJohnsonSimonsTarjan81]

Call_min_dist, M. R. Garey, D. S. Johnson, B. B. Simons, R. E. Tarjan, Scheduling unit-time tasks with arbitrary release times and deadlines SIAM Journal on Computing 10(2) 1981 256–269

[GarganiRefalo07]

Ccoloured_cumulative, A. Gargani, P. Refalo, An Efficient Model and Strategy for the Steel Mill Slab Design Problem Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 77–89 2007

[Gecode06]

sec3.1, sec3.3.4, Cdisj, Cdom_reachability, C. Schulte, M. Lagerkvist, G. Tack, Gecode 2006 Available at http://www.gecode.org

[GehringMenschnerMeyer90]

Cdiffn, H. Gehring, K. Menschner, M. Meyer, A computer-based heuristic for packing pooled shipment containers European Journal of Operational Research 44 1990 277–288

[GentJeffersonMiguel06]

sec3.1, I. P. Gent, C. Jefferson, I. Miguel, Minion: A Fast Scalable Constraint Solver ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings IOS Press 98–102 2006

[GentMiguelNightingale08]

Calldifferent, I. P. Gent, I. Miguel, P. Nightingale, Generalised arc consistency for the Alldifferent constraint: An empirical survey Artificial Intelligence 18 172 2008 1973–2000

[GentNightingale04]

KSAT, I. P. Gent, P. Nightingale, A new encoding of the alldifferent constraint into SAT CP'2004 Third International Workshop on Modelling and Reformulating Constraint Satisfaction Problems A. Frisch, I. Miguel, 95–110 Toronto, Canada September 2004

[GentProsserSmithWei03]

Cstable_compatibility, I. P. Gent, P. Prosser, B. M. Smith, W. Wei, Supertree Construction with Constraint Programming Principles and Practice of Constraint Programming (CP'2003) LNCS 2833 Springer-Verlag F. Rossi, 837–841 2003

[Georgiadis05]

Cdom_reachability, L. Georgiadis, Linear-Time Algorithms for Dominators and Related Problems Ph. D. Thesis Princeton University, USA 2005

[GinsbergHarvey95]

Klimited_discrepancy_search, Cdiscrepancy, M. L. Ginsberg, W. D. Harvey, Limited Discrepancy Search 14th Int. Joint Conf. on Artificial Intelligence (IJCAI-95) 1 Morgan Kaufmann C. S. Mellish, 607–615 1995

[Glover67]

Kbipartite_matching_in_convex_bipartite_graphs, Calldifferent, F. Glover, Maximum matchings in convex bipartite graphs Naval Res. Logist. Quart. 14 1967 313–316

[Golomb65]

Cpolyomino, Cpolyomino, S. W. Golomb, Polyominoes Scribners New York 1965

[Golomb72]

Cgolomb, S. W. Golomb, How to Number a Graph R. C. Read, Graph Theory and Computing Academic Press New York 1972 23–37

[GondranMinoux84]

sec2.3.2.4, M. Gondran, M. Minoux, Graphs and Algorithms 2nd Revised Wiley New York 1984

[GrandcolasPinto10]

KSAT, S. Grandcolas, C. Pinto, A SAT Encoding for Multi-dimensional Packing Problems International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 141–146 Bologna, Italy 2010

[Gregor79]

Cgraph_isomorphism, Csubgraph_isomorphism, J. J. McGregor, Relational consistency algorithms and their application in finding subgraph and graph isomorphism Inf. Sci. 3 19 1979 229–250

[Grinberg68]

Ccircuit, E. Y. Grinberg, Plane homogeneous graphs of degree three without Hamiltonian circuits Latv. Mat. Ezhegodnik 4 1968 51–58 In Russian

[GuernalecColmerauer97]

Calldifferent, Csort, N. Bleuzen-Guernalec, A. Colmerauer, Narrowing a Block of Sortings in Quadratic Time Principles and Practice of Constraint Programming (CP'97) LNCS 1330 Springer-Verlag G. Smolka, 2–16 1997

[Hansen75]

sec4.3.4.3, P. Hansen, Degrés et nombre de stabilité d'un graphe Cahiers du Centre d'Études de Recherche Opérationnelle 17 1975 213–220

[HararySchwenk72]

Ctwo_layer_edge_crossing, Ctwo_layer_edge_crossing, F. Harary, A. J. Schwenk, A new crossing number for bipartite graphs Utilitas Math. 1 1972 203–209

[HardyWright75]

Celem, G. H. Hardy, E. M. Wright, Theory of numbers Oxford Univ. Press Oxford 1975

[HarveySchimpf02]

Cscalar_product, W. Harvey, J. Schimpf, Bounds Consistency Techniques for Long Linear Constraints CP'02 Workshop on Techniques foR Implementing Constraint programming Systems (TRICS) 39–46 2002

[HebrardHnichSullivanWalsh05]

Kdegree_of_diversity_of_a_set_of_solutions, E. Hebrard, B. Hnich, B. O'Sullivan, T. Walsh, Finding diverse and similar solutions in constraint programming 20th National Conference on Artificial Intelligence (AAAI'05) AAAI Press M. Veloso, S. Kambhampati, 372–377 July 2005

[HebrardMarxSullivanRazgon09]

Csoft_all_equal_max_var, Csoft_all_equal_max_var, Csoft_all_equal_min_ctr, Csoft_all_equal_min_var, Csoft_all_equal_min_var, Csoft_alldifferent_ctr, Csoft_alldifferent_var, B. O. E. Hebrard, I. Razgon, Constraints of Difference and Equality: A Complete Taxonomic Characterisation Principles and Practice of Constraint Programming (CP'2009) LNCS 5732 Springer-Verlag I. P. Gent, 424–438 2009

[HebrardSullivanRazgon08]

Csoft_all_equal_min_ctr, Csoft_all_equal_min_ctr, E. Hebrard, B. O'Sullivan, I. Razgon, A Soft Constraint of Equality: Complexity and Approximability Principles and Practice of Constraint Programming (CP'2008) LNCS 5202 Springer-Verlag P. J. Stuckey, 358–371 2008

[HeinzSchlechteStephanWinkler12]

Ccoloured_cumulative, S. Heinz, T. Schlechte, R. Stephan, M. Winkler, Solving steel mill slab design problems Constraints 1 17 2012 39–50

[HellRosa72]

Cmax_occ_of_tuples_of_values, P. Hell, A. Rosa, Graph decomposition, handcuffed prisoners and balanced p-designs Discrete Mathematic 3 2 1972 229–252

[Hellsten04]

Cchange, Csmooth, Cstretch_circuit, Cstretch_path, L. Hellsten, Consistency Propagation for Stretch Constraints Masters thesis Waterloo University 2004

[HellstenPesantBeek04]

Cstretch_circuit, Cstretch_path, Cstretch_path, Cstretch_path, L. Hellsten, G. Pesant, P. van Beek, A Domain Consistency Algorithm for the Stretch Constraint Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 290–304 2004

[HenriksenJensenJorgensenKlarlundPaigeRauheSandholm95]

sec2, J. G. Henriksen, J. L. Jensen, M. E. Jørgensen, N. Klarlund, R. Paige, T. Rauhe, A. Sandholm, Mona: Monadic Second-Order Logic in Practice Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS'95, Aarhus, Denmark LNCS 1019 Springer-Verlag E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, B. Steffen, 89–110 May 1995

[HenzMullerThiel02]

Csymmetric_alldifferent, M. Henz, T. Müller, S. Thiel, Global Constraints for Round Robin Tournament Scheduling European Journal of Operations Research 1 153 Feb 2004 92–101

[Hernandez07]

Kchannelling_constraint, B. M. Hernández, The Systematic Generation of Channelled Models in Constraint Satisfaction Ph. D. Thesis University of York, York, YO10 5DD, UK, Department of Computer Science 2007

[HodaHoeveHooker10]

sec2, S. Hoda, W.-J. van Hoeve, J. N. Hooker, A Systematic Approach to MDD-Based Constraint Programming Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 266–280 St Andrews, Scotland 2010

[Hoeve01]

Calldifferent, W.-J. van Hoeve, The alldifferent Constraint: A Survey Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints Prague, Czech Republic June 2001 Available at http://arxiv.org/html/cs/0110012

[Hoeve04]

sec2, Csoft_alldifferent_ctr, W.-J. van Hoeve, A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 679–689 2004

[HoevePesantRousseau04]

sec2, sec3.2, sec3.2, sec3.2, Cglobal_cardinality, W.-J. van Hoeve, G. Pesant, L.-M. Rousseau, On Global Warming (Softening Global Constraints) Workshop on Soft Constraints Toronto, Canada September 2004

[HoevePesantRousseau06]

sec3.2, sec3.2, W.-J. van Hoeve, G. Pesant, L.-M. Rousseau, On global warming: Flow-based soft global constraints Journal of Heuristics 4–5 12 2006 347–373

[HoevePesantRousseauSabharwal06]

Camong_seq, Camong_seq, W.-J. van Hoeve, G. Pesant, L.-M. Rousseau, A. Sabharwal, Revisiting the Sequence Constraint Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 620–634 Nantes, France 2006

[HoeveRegin06]

Kopen_constraint, Copen_alldifferent, Copen_alldifferent, Copen_alldifferent, Copen_global_cardinality, Copen_global_cardinality, Copen_global_cardinality, Copen_global_cardinality, Copen_global_cardinality_low_up, Copen_global_cardinality_low_up, Copen_global_cardinality_low_up, W.-J. van Hoeve, J.-C. Régin, Open Constraints in a Closed World International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 244–257 Cork, Ireland May/June 2006

[HoeveSabharwal07]

Catmost1, Catmost1, Csum_free, Csum_free, W.-J. van Hoeve, A. Sabharwal, Two Set-Constraints for Modeling and Efficiency Sixth International Workshop on Constraint Modelling and Reformulation (ModRef'07), Providence, USA 2007

[Hooker07]

preface, J. N. Hooker, Good and Bad Futures for Constraint Programming (and Operations Research) Constraint Programming Letters 1 November 2007 21–32

[Hooker07book]

Klinear_programming, Calldifferent, Calldifferent, Ccircuit, Cdisjunctive, Cglobal_cardinality_low_up, J. N. Hooker, Integrated Methods for Optimization Springer Science + Business Media, LLC New York 2007

[HookerYan02]

sec2, Ccumulative, J. N. Hooker, H. Yan, A Relaxation for the cumulative Constraint Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 686–690 2002 Available at http://ba.gsia.cmu.edu/jnh/papers.html

[HopcroftTarjan74]

Ccircuit, J. Hopcroft, R. E. Tarjan, Efficient Planarity Testing Journal of the Association for Computing Machinery 4 21 October 1974 549–568

[Hopper00]

Kstrip_packing, E. Hopper, Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods Ph. D. Thesis Cardiff University, UK 2000

[Hougardy12]

KPartridge, S. Hougardy, Personal communication June 8, 2012

[Hujter90]

Cdiffn, M. Hujter, On the dynamic storage allocation problem Technical report Manuscript, Computer and Automation Institute, Hungarian Acad. Sci. 1990

[Isermann91]

Kpallet_loading, H. Isermann, Obere Schranken für die Lösung des zweidimensionalen Packproblems auf der Basis struktureller Identitäten Operations Research – Beiträge zur quantitativen Wirtschaftforschung Springer-Verlag Fandel, Gehring, 341–348 1991

[ItalianoLauraSantaroni10]

Kstrong_articulation_point, Kstrong_bridge, Ctree, G. F. Italiano, L. Laura, F. Santaroni, Finding Strong Bridges and Strong Articulation Points in Linear Time Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings, Part I LNCS 6508 Springer-Verlag W. Wu, O. Daescu, 157–169 Kailua-Kona, Hawaii, USA 2010

[Jackson1821]

Corchard, Corchard, J. Jackson, Rational Amusements for Winter Evenings Longman, London 1821

[Jackson55]

Cdisjunctive, J. R. Jackson, Scheduling a Production Line to Minimize Maximum Tardiness Technical report 43 University of California Los Angeles 1955 Management Science Research Project

[Jaulin06]

KSLAM_problem, L. Jaulin, Localization of an Underwater Robot using Interval Constraint Programming Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 244–255 Nantes, France 2006

[JussienBarichard00]

Calldifferent, N. Jussien, V. Barichard, The PALM system: explanation-based constraint programming CP'00 Workshop on Techniques foR Implementing Constraint programming Systems (TRICS) 118–133 2000

[Kale90]

Kn-queens, L. V. Kalè, An Almost Perfect Heuristic for the N-queens Problem Information Processing Letters 4 34 April 1990 173–178

[KameugneFotsoScottNgoKateu11]

Ccumulative, R. Kameugne, L. P. Fotso, J. Scott, Y. Ngo-Kateu, A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints Principles and Practice of Constraint Programming (CP'2011) LNCS 6876 Springer-Verlag J. H. Lee, 478–492 Perugia, Italy 2011

[Katriel05]

Cglobal_cardinality, Csame, Cused_by, I. Katriel, Constraints and Changes Ph. D. Thesis Saarlandes University, Germany 2005

[Katriel06]

KDFS-bottleneck, I. Katriel, Expected-Case Analysis for Delayed Filtering International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 119–125 Cork, Ireland May/June 2006

[KatrielThiel03]

sec2, Cglobal_cardinality, I. Katriel, S. Thiel, Fast Bound Consistency for the Global Cardinality Constraint Principles and Practice of Constraint Programming (CP'2003) LNCS 2833 Springer-Verlag F. Rossi, 437–451 2003

[KatrielThielConstraints05]

Cglobal_cardinality, I. Katriel, S. Thiel, Complete Bound Consistency for the Global Cardinality Constraint Constraints 10(3) 2005

[KatrielVanHentenryck06]

KDFS-bottleneck, I. Katriel, P. Van Hentenryck, Randomized Filtering Algorithms Technical report CS-06-09 Department of Computer Science, Brown University 2006

[KayaHooker06]

Ccircuit, L. G. Kaya, J. N. Hooker, A Filter for the circuit Constraint Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 706–710 Nantes, France 2006

[Keber85]

Kpallet_loading, R. Keber, Stauraumprobleme bei Stückguttransporten Technical report Heft 17 Wissenschaftliche Berichte des Institutes für Fördertechnik der Universität Karlsruhe 1985

[Kirkman1847]

sec2, T. P. Kirkman, On a Problem in Combinatorics Cambridge and Dublin Math. J. 2 1847 191–204

[Kiziltan04]

Clex_greater, Clex_greater, Clex_greatereq, Clex_greatereq, Clex_less, Clex_less, Clex_lesseq, Clex_lesseq, Z. Kızıltan, Symmetry Breaking Ordering Constraints Ph. D. Thesis Uppsala University, Sweden March 2004

[KiziltanWalsh02]

Csame, Z. Kızıltan, T. Walsh, Constraint Programming with Multisets Second International Workshop on Symmetry on Constraint Satisfaction Problems (SymCon-02) 2002 held along CP-2002

[KocjanKreuger04]

Csymmetric_cardinality, Csymmetric_gcc, W. Kocjan, P. Kreuger, Filtering Methods for Symmetric Cardinality Constraint Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'04) LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 200–208 2004

[Korf04]

Ksmallest_rectangle_area, Ksmallest_rectangle_area, R. E. Korf, Optimal Rectangle Packing: New Results Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-2004) 142–149 2004

[Kuhn55]

KHungarian_method_for_the_assignment_problem, Cminimum_weight_alldifferent, H. W. Kuhn, The Hungarian Method for the Assignment Problem Naval Research Logistics Quaterly 1–2 2 March–June 1955 83–97

[LabbeLaporteRodriguezMartin98]

Ccycle_or_accessibility, Ccycle_or_accessibility, Ctemporal_path, M. Labbé, G. Laporte, I. Rodríguez-Martín, Path, tree and cycle location Fleet Management and Logistics Kluwer Academic Publishers 1998 187–204

[Laburthe00]

sec3.1, sec3.3.4, F. Laburthe, Choco: Implementing a CP Kernel CP'00 Workshop on Techniques foR Implementing Constraint programming Systems (TRICS) 2000

[LagerkvistPesant08]

Kpentomino, M. Z. Lagerkvist, G. Pesant, Modeling Irregular Shape Placement Problems with Regular Constraints First Workshop on Bin Packing and Placement Constraints BPPC'08, associated to CPAIOR08 2008

[LagerkvistSchulte09]

KBerge-acyclic_constraint_network, M. Z. Lagerkvist, C. Schulte, Propagator Groups Principles and Practice of Constraint Programming (CP'2009) LNCS 5732 Springer-Verlag I. P. Gent, 524–538 2009

[Lahrichi79]

Kcompulsory_part, A. Lahrichi, Ordonnancements: la notion de partie obligatoire et son application aux problèmes cumulatifs Ph. D. Thesis Paris 6 University, France May 1979 In French

[Lahrichi82]

Kcompulsory_part, Ccumulative, Ccumulative_convex, Ccumulative_two_d, Cdisjunctive, A. Lahrichi, Scheduling: the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems C.R. Acad. Sci., Paris 294 February 1982 209–211

[Lahrichi82a]

Kcompulsory_part, A. Lahrichi, Ordonnancements: la notion de partie obligatoire et son application aux problèmes cumulatifs RAIRO-Recherche Opérationnelle 16(3) 1982 241–262 In French

[LahrichiGondran84]

Kcompulsory_part, A. Lahrichi, M. Gondran, Théorie des parties obligatoires et découpes à deux dimensions Technical report HI/4762-02 Électricité de France (EDF) January 1984 In French

[LaporteAsefVaziriSriskandarajah96]

Ccircuit_cluster, Ccircuit_cluster, G. Laporte, A. Asef-Vaziri, C. Sriskandarajah, Some Applications of the Generalized Travelling Salesman Problem J. of the Operational Research Society 47 1996 1461–1467

[LardeuxMonfroySaubion08]

Ck_alldifferent, F. Lardeux, E. Monfroy, F. Saubion, Interleaved alldifferent Constraints: CSP vs. SAT Approaches Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008 LNCS 5253 Springer-Verlag D. Dochev, M. Pistore, P. Traverso, 380–384 2008

[LarrosaValiente02]

Csubgraph_isomorphism, J. Larrosa, G. Valiente, Constraint satisfaction algorithms for graph pattern matching Mathematical Structures in Computer Science 4 12 August 2002 403–422

[Lauriere76]

Calldifferent, Calldifferent, J.-L. Laurière, Un langage et un programme pour énoncer et résoudre des problèmes combinatoires Thèse de Doctorat d'État Paris 6 University, France May 1976 In French

[Lauriere78]

preface, sec3.1, Calldifferent, Calldifferent, Ccircuit, Ccycle, J.-L. Laurière, A Language and a Program for Stating and Solving Combinatorial Problems Artificial Intelligence 1 10 1978 29–127

[Law05]

Kindistinguishable_values, Cset_value_precede, Y. C. Law, Using Constraints to Break Value Symmetries in Constraint Satisfaction Problems Ph. D. Thesis The Chinese University of Hong Kong September 2005

[LeHuedeGrabischLabreucheSaveant06]

sec3.2, sec4.1, F. L. Huédé, M. Grabisch, C. Labreuche, P. Savéant, Integration and propagation of a multi-criteria decision making model in constraint programming Journal of Heuristics 4–5 12 September 2006 329–346

[Leconte96]

Calldifferent, Calldifferent, M. Leconte, A Bounds-Based Reduction Scheme for Constraints of Difference CP'96, Second International Workshop on Constraint-based Reasoning 19–28 Key West, FL, USA 1996

[LevyLow88]

Ccutset, H. Levy, D. W. Low, A contraction algorithm for finding small cycle cutsets J. of Algorithms 9 1988 470–493

[LiCheng90]

Cdiffn, K. Li, K.-H. Cheng, On Three-Dimensional Packing SIAM Journal on Computing 5 19 1990 847–867

[LindnerRosa80]

Cmax_occ_of_tuples_of_values, C. C. Lindner, A. Rosa, Topics on Steiner Systems Annals of Discrete Mathematic 7 1980

[LinharesYanasse02]

Ccumulative_convex, A. Linhares, H. H. Yanasse, Connections between cutting-pattern sequencing, VLSI design and flexible machines Computers and Operations Research 29 2002 1759–1772

[LintWilson92]

Ksquared_squares, J. H. van Lint, R. M. Wilson, A Course in Combinatorics Cambridge University Press 1992

[LloydSoffaWang88]

Ccutset, E. L. Lloyd, M. L. Soffa, C. C. Wang, On locating minimum feedback vertex sets J. of Computer and System Science 37 1988 292–311

[Lock96]

Ccumulative, H. C. R. Lock, An Implementation of the cumulatives Constraint Technical report University of Karlsruhe 1996 Working paper

[LopezOrtizQuimperTrompBeek03]

Calldifferent, Calldifferent, Calldifferent, A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, P. van Beek, A Fast and Simple Algorithm for Bounds Consistency of the alldifferent Constraint Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI'2003) 245–250 2003

[Lubiw85]

Clex2, A. Lubiw, Doubly Lexical Orderings of Matrices Proceedings of the 17th Annual Association for Computing Machinery Symposium on Theory of Computing (STOC-85) ACM Press 396–404 1985

[Lubiw87]

Clex2, A. Lubiw, Doubly Lexical Orderings of Matrices SIAM Journal on Computing 5 16 October 1987 854–879

[Lucas1882]

sec2, E. Lucas, Récréations mathématiques 1-2 Gauthier-Villars 1882

[Maculet91]

Kfloor_planning_problem, Kfloor_planning_problem, R. Maculet, Représentation des connaissances spatiales (algèbre de Manhattan et raisonnement spatial avec contraintes Ph. D. Thesis Paris VI University, France 1991 In French

[Maher02]

sec2.4.1, Cglobal_contiguity, Cglobal_contiguity, Cglobal_contiguity, M. J. Maher, Analysis of a Global Contiguity Constraint Workshop on Rule-Based Constraint Reasoning and Programming 2002 held along CP-2002

[Maher09c]

Kcontractible, Kcontractible, Kopen_constraint, M. J. Maher, Open Contractible Global Constraints 21th Int. Joint Conf. on Artificial Intelligence (IJCAI-09) 578–583 2009

[MaherNarodytskaQuimperWalsh08]

Camong_seq, Csliding_sum, M. J. Maher, N. Narodytska, C.-G. Quimper, T. Walsh, Flow-Based Propagators for the sequence and Related Global Constraints Principles and Practice of Constraint Programming (CP'2008) LNCS 5202 Springer-Verlag P. J. Stuckey, 159–174 2008

[Marte01]

Ctrack, M. Marte, A Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling CP'2001 Doctoral Programme 2001

[MartelloToth90]

Cbin_packing, S. Martello, P. Toth, Knapsack problems. Algorithms and Computer Implementations Interscience Series in Discrete Mathematics and Optimization Wiley 1990

[MartinShmoys96]

Ck_alldifferent, P. Martin, D. B. Shmoys, A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings LNCS 1084 Springer-Verlag W. H. Cunningham, S. T. McCormick, M. Queyranne, 389–403 1996

[Medjdoub96]

Kfloor_planning_problem, B. Medjdoub, Méthodes de conception fonctionnelle en architecture: une approche CAO basée sur des contraintes: ARCHiPLAN Ph. D. Thesis École Centrale de Paris, France May 1996 In French

[MedjdoubYannou00]

Kfloor_planning_problem, B. Medjdoub, B. Yannou, Separating topology and geometry in space planning Computer-aided design 1 32 2000 39–61

[Mehlhorn00]

sec2, K. Mehlhorn, Constraint Programming and Graph Algorithms 27th International Colloquium on Automata, Languages and Programming (ICALP'2000) LNCS 1853 Springer-Verlag U. Montanari, J. D. P. Rolim, E. Welzl, 571–575 2000

[MehlhornThiel00]

sec2, Calldifferent, Calldifferent, Calldifferent, Csort, K. Mehlhorn, S. Thiel, Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint Principles and Practice of Constraint Programming (CP'2000) LNCS 1894 Springer-Verlag 306–319 2000

[MenanaDemassey09]

sec3.2, J. Menana, S. Demassey, Sequencing and Counting with the multicost-regular Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09) LNCS 5547 Springer-Verlag W.-J. van Hoeve, J. N. Hooker, 178–192 Pittsburgh, PA, USA 2009

[MercierVanHentenryck08]

Ccumulative, L. Mercier, P. Van Hentenryck, Edge finding for cumulative scheduling Informs Journal of Computing 20 2008 143–153

[Metivier10]

sec3.2, sec3.2, sec3.2, sec3.2, J.-P. Métivier, Relaxation de contraintes globales : Mise en oeuvre et Application Ph. D. Thesis Caen University, France 2010 In French

[MittalFalkenhainer90]

Csize_max_starting_seq_alldifferent, S. Mittal, B. Falkenhainer, Dynamic Constraint Satisfaction Problems 8th National Conference on Artificial Intelligence (AAAI-90) AAAI Press 25–32 1990

[Mohri2009]

Kreverse_of_a_constraint, M. Mohri, Weighted automata algorithms M. Droste, W. Kuich, H. Vogler, Handbook of Weighted Automata Monographs in Theoretical Computer Science Springer 2009 213–254

[MonetteDevilleDupont07]

Cdisj, Cdisj, J.-N. Monette, Y. Deville, P. Dupont, A Position-Based Propagator for the Open-Shop Problem International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07) LNCS 4150 Springer-Verlag P. Van Hentenryck, L. Wolsey, 186–199 Brussels, Belgium May 2007

[Mozart06]

sec3.1, Cdom_reachability, M. Consortium, The Mozart Programming System, version 1.3.2 2006 Available at http://www.mozart-oz.org

[MullerHannemannStilleWeihe03a]

Cbin_packing, M. Müller-Hannemann, W. Stille, K. Weihe, Patterns of Usage for Global Constraints: A Case Study Based on the Bin-Packing Constraint Technical report TU Darmstadt 2003

[MullerHannemannStilleWeihe03b]

Cbin_packing, M. Müller-Hannemann, W. Stille, K. Weihe, Evaluating the Bin-Packing Constraint, Part I: Overview of the Algorithmic Approach Technical report TU Darmstadt 2003

[MullerHannemannStilleWeihe03c]

Cbin_packing, M. Müller-Hannemann, W. Stille, K. Weihe, Evaluating the Bin-Packing Constraint, Part II: An Adaptive Rounding Problem Technical report TU Darmstadt 2003

[MullerHannemannStilleWeihe03d]

Cbin_packing, M. Müller-Hannemann, W. Stille, K. Weihe, Evaluating the Bin-Packing Constraint, Part III: Joint Evaluation with Concave Constraints Technical report TU Darmstadt 2003

[Nelissen94]

Kpallet_loading, Cdiffn, Cdiffn, J. Nelissen, Neue Ansätze zur Lösung des Palettenbeladungsproblems Ph. D. Thesis RWTH Aachen, Germany 1994 In German

[NethercoteStuckeyBecketBrandDuckTack07]

sec4.5.2.1, N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck, G. Tack, MiniZinc: Towards a Standard CP Modelling Language Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 529–543 2007

[NgWormald96]

Cstable_compatibility, Cstable_compatibility, Cstable_compatibility, M. P. Ng, N. C. Wormald, Reconstruction of rooted trees from subtrees Discrete Applied Mathematics 69 1996 19–31

[Nieuwenhuis10]

sec2, R. Nieuwenhuis, SAT Modulo Theories: Getting the Best of SAT and Global Constraint Filtering Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 1–2 St Andrews, Scotland 2010

[OlderSwinkelsEmden95]

Csame, Csort, W. J. Older, G. M. Swinkels, M. H. van Emden, Getting to the Real Problem: Experience with BNR Prolog in OR 3rd Int. Conf. on the Practical Application of Prolog (PAP'95) Alinmead Software Ltd. 465–478 1995

[OplobeduMarcovitchTourbier89]

sec3.1, Cglobal_cardinality, A. Oplobedu, J. Marcovitch, Y. Tourbier, CHARME: Un langage industriel de programmation par contraintes, illustré par une application chez Renault Proceedings of the Ninth International Workshop on Expert Systems and their Applications: General Conference 1 55–70 1989

[OstergardWeakley01]

Kdominating_queens, P. Östergård, W. Weakley, Values of domination numbers of the queen's graph The Electronic Journal of Combinatorics 1 8 2001

[OttossonThorsteinsson00]

Celement_product, Celement_product, G. Ottosson, E. S. Thorsteinsson, Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts Second International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems March 2000

[OttossonThorsteinssonHooker99]

Celement_greatereq, Celement_greatereq, Celement_lesseq, Celement_lesseq, G. Ottosson, E. S. Thorsteinsson, J. N. Hooker, Mixed Global Constraints and Inference in Hybrid IP-CLP Solvers CP'99 Post-Conference Workshop on Large-Scale Combinatorial Optimization and Constraints 57–78 1999

[OuelletQuimper11]

Cmulti_inter_distance, Cmulti_inter_distance, P. Ouellet, C.-G. Quimper, The Multi-Inter-Distance Constraint 22th Int. Joint Conf. on Artificial Intelligence (IJCAI-11) 2011

[PachetRoy99]

Cchange, Cnvalue, Cnvalue, F. Pachet, P. Roy, Automatic Generation of Music Programs Principles and Practice of Constraint Programming (CP'99) LNCS 1713 Springer-Verlag 331–345 1999

[PeridyRivreau05]

Cdisjunctive, L. Péridy, D. Rivreau, An $O(nlogn)$ Stable Algorithm for Immediate Selections Adjustments Multidisciplinary Scheduling: Theory and Applications, 1st International Conference Selected Papers Springer-Verlag G. Kendall, E. K. Burke, S. Petrovic, M. Gendreau, 205–222 2005

[Pesant01]

Cchange, Cincreasing_nvalue, Csmooth, Cstretch_circuit, Cstretch_circuit, Cstretch_circuit, Cstretch_path, Cstretch_path, Cstretch_path, G. Pesant, A Filtering Algorithm for the Stretch Constraint Principles and Practice of Constraint Programming (CP'2001) LNCS 2239 Springer-Verlag T. Walsh, 183–195 2001

[Pesant04]

preface, sec3.2, Kautomaton_without_counters, Cchange, Cpattern, Csmooth, G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 482–495 2004

[PesantRegin05]

sec3.2, Kbalanced_assignment, G. Pesant, J.-C. Régin, SPREAD: A Balancing Constraint Based on Statistics Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 460–474 2005

[PesantSoriano98]

Csymmetric_alldifferent, G. Pesant, P. Soriano, An Optimal Strategy for the Constrained Cycle Cover Problem CRT Pub. 98-45 CRT Montréal December 1998

[Petersen1891]

Calldifferent, J. Petersen, Die Theorie der Regularen Graphs Acta Mathematica 15 1891 193–220

[PetitBeldiceanuLorca11]

Cchange, Cincreasing_nvalue, Csmooth, T. Petit, N. Beldiceanu, X. Lorca, A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints 22th Int. Joint Conf. on Artificial Intelligence (IJCAI-11) 2011

[PetitPoder09]

Csoft_cumulative, T. Petit, E. Poder, The Soft Cumulative Constraint CoRR abs/0907.0939 2009

[PetitRegin09]

Cordered_global_cardinality, Cordered_global_cardinality, Cordered_global_cardinality, T. Petit, J.-C. Régin, The Ordered Global Cardinality Constraint Technical report 09-07-INFO École des Mines de Nantes 2009

[PetitReginBeldiceanu11]

Cincreasing_sum, Cincreasing_sum, T. Petit, J.-C. Régin, N. Beldiceanu, A $\Theta \left(n\right)$ Bound-Consistency Algorithm for the increasing sum Constraint Principles and Practice of Constraint Programming (CP'2011) LNCS 6876 Springer-Verlag J. H. Lee, 721–728 Perugia, Italy 2011

[PetitReginBessiere01]

sec2, Csoft_alldifferent_ctr, Csoft_alldifferent_ctr, Csoft_alldifferent_var, Csoft_alldifferent_var, Csoft_alldifferent_var, T. Petit, J.-C. Régin, C. Bessière, Specific Filtering Algorithms for Over-Constrained Problems Principles and Practice of Constraint Programming (CP'2001) LNCS 2239 Springer-Verlag T. Walsh, 451–463 2001

[Pfefferkorn75]

Kfloor_planning_problem, C. E. Pfefferkorn, A Heuristic Problem Solving Design System for Equipment or Furniture Layouts Communications of the ACM 5 18 May 1975 286–297

[Pitrat01]

preface, Cglobal_cardinality, J. Pitrat, MALICE, notre collègue Colloque Métaconnaissance de Berder 4–19 September 2001 In French

[Pitrat08]

preface, sec3.6.14, Klogigraphe, Cglobal_cardinality, J. Pitrat, A Step toward an Artificial Artificial Intelligence Scientist Technical report Paris VI University, France 2008

[Pitrat09]

preface, J. Pitrat, Artificial Beings Wiley InterScience April 2009

[Platon03]

sec3.1, Cchange, PLATON. team, Eclair Thales R & T V8.0 Orsay, France 2003 Technical report 61 364

[Poder02]

Kcompulsory_part, E. Poder, Programmation par contraintes et ordonnancement de tâches avec consommation variable de ressource Ph. D. Thesis Blaise-Pascal - Clermont II University, France October 2002 In French

[PoderBeldiceanuSanlaville04]

sec3.2, Kcompulsory_part, Kcompulsory_part, E. Poder, N. Beldiceanu, E. Sanlaville, Computing a Lower Approximation of the Compulsory Part of a Task with Varying Duration and Varying Resource Consumption European Journal of Operational Research 153 2004 239–254

[PraletVerfaillie09]

sec3.7.226, C. Pralet, G. Verfaillie, Slice Encoding for Constraint-based Planning Principles and Practice of Constraint Programming (CP'2009) LNCS 5732 Springer-Verlag I. P. Gent, 669–683 2009

[PreparataShamos85]

Ksweep, F. P. Preparata, M. I. Shamos, Computational Geometry. An Introduction. Springer-Verlag New York, Berlin 1985 Corrected and Expanded Second Printing

[Puget03]

Csubgraph_isomorphism, J.-F. Puget, Using Constraint Programming to Compute Symmetries Third International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon-03) 2003 held along CP-2003

[Puget05a]

Csubgraph_isomorphism, J.-F. Puget, Symmetry Breaking Revisited Constraints 1 10 2005 23–46

[Puget05b]

Csubgraph_isomorphism, J.-F. Puget, Automatic Detection of Variable and Value Symmetries Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 477–489 2005

[Puget94]

sec3.1, J.-F. Puget, A C++ Implementation of CLP Second Singapore International Conference on Intelligent Systems (SPICIS) 256–261 Singapore November 1994

[Puget98]

Calldifferent, Calldifferent, J.-F. Puget, A Fast Algorithm for the Bound Consistency of alldiff Constraints 15th National Conference on Artificial Intelligence (AAAI-98) AAAI Press 359–366 1998

[Quesada06]

Cdom_reachability, Cdom_reachability, Cdom_reachability, L. O. Quesada, Solving Constrained Graph Problems using Reachability Constraints based on Transitive Closure and Dominators Ph. D. Thesis University catholic of Louvain, Belgium November 2006

[QuesadaVanRoyDeville05]

Cdom_reachability, L. O. Quesada, P. Van Roy, Y. Deville, Reachability: a constrained path propagator implemented as a multi-agent system CLEI2005 2005

[QuesadaVanRoyDevilleCollet06]

Cdom_reachability, L. O. Quesada, P. Van Roy, Y. Deville, R. Collet, Using Dominators for Solving Constrained Path Problems Practical Aspects of Declarative Languages, 8th International Symposium LNCS 3819 Springer-Verlag P. Van Hentenryck, 73–87 Charleston, SC, USA January 2006

[Quimper03]

Cglobal_cardinality, C. Quimper, Enforcing domain consistency on the extended global cardinality constraint is NP-hard Technical report TR CS-2003-39 School of Computer Science, University of Waterloo 2003

[QuimperBeekOrtizGolynskiSadjad03]

Cglobal_cardinality, C.-G. Quimper, P. van Beek, A. López-Ortiz, A. Golynski, S. B. Sadjad, An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint Principles and Practice of Constraint Programming (CP'2003) LNCS 2833 Springer-Verlag F. Rossi, 600–614 2003

[QuimperLopezOrtizBeekGolynski04]

sec2, Cglobal_cardinality, C.-G. Quimper, A. López-Ortiz, P. van Beek, A. Golynski, Improved Algorithms for the Global Cardinality Constraint Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 542–556 2004

[QuimperOrtizPesant06]

Call_min_dist, C.-G. Quimper, A. López-Ortiz, G. Pesant, A Quadratic Propagator for the Inter-Distance Constraint 21th National Conference on Artificial Intelligence (AAAI'06) AAAI Press 2006

[QuimperWalsh05]

sec3.2, Calldifferent_between_sets, Clex_alldifferent, Clex_alldifferent, C.-G. Quimper, T. Walsh, Beyond Finite Domains: The All Different and Global Cardinality Constraints Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 812–816 2005

[QuimperWalsh06]

Calldifferent_between_sets, Clex_alldifferent, C.-G. Quimper, T. Walsh, The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables Recent Advances in Constraints, Joint ERCIM/Colognet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP05; Uppsala, Sweden, June 2005; Revised Selected and Invited Papers LNAI 3978 Springer-Verlag B. Hnich, M. Carlsson, F. Fages, F. Rossi, 1–13 2006

[QuimperWalshReport05]

sec3.2, Calldifferent_between_sets, Clex_alldifferent, C.-G. Quimper, T. Walsh, Beyond Finite Domains: the All Different and Global Cardinality Constraints Constraint Programming Beyond Finite Integer Domains (CP'2005) F. Azevedo, C. Gervet, E. Pontelli, 5–17 October 2005

[RandellCuiCohn92]

Krcc8, Ccontains_sboxes, Ccontains_sboxes, Ccoveredby_sboxes, Ccoveredby_sboxes, Ccovers_sboxes, Ccovers_sboxes, Cdisjoint_sboxes, Cdisjoint_sboxes, Cequal_sboxes, Cequal_sboxes, Cinside_sboxes, Cinside_sboxes, Cmeet_sboxes, Cmeet_sboxes, Coverlap_sboxes, Coverlap_sboxes, D. A. Randell, Z. Cui, A. G. Cohn, A spatial logic based on regions and connection Proc. of 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'92) Morgan Kaufmann B. Nebel, C. Rich, W. R. Swartout, 165–176 1992

[Refalo00]

Cdomain_constraint, P. Refalo, Linear Formulation of Constraint Programming Models and Hybrid Solvers Principles and Practice of Constraint Programming (CP'2000) LNCS 1894 Springer-Verlag 2000

[Regin02]

Cglobal_cardinality_with_costs, J.-C. Régin, Cost-Based Arc Consistency for Global Cardinality Constraints Constraints 3–4 7 2002 387–405

[Regin03]

Cclique, J.-C. Régin, Using Constraint Programming to Solve the Maximum Clique Problem Principles and Practice of Constraint Programming (CP'2003) LNCS 2833 Springer-Verlag F. Rossi, 634–648 2003

[Regin03CPAIOR]

Cclique, J.-C. Régin, Solving the Maximum Clique Problem with Constraint Programming Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'03) 166–179 Montréal, Canada May 2003

[Regin08]

sec3.2, Ctree, J.-C. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'08) LNCS 5015 Springer-Verlag L. Perron, M. A. Trick, 233–247 Paris, France 2008

[Regin94]

sec2, sec2.1.3, sec2.4.1, Calldifferent, Calldifferent, J.-C. Régin, A Filtering Algorithm for Constraints of Difference in CSP 12th National Conference on Artificial Intelligence (AAAI-94) 362–367 1994

[Regin95]

Catleast_nvalue, Catleast_nvalue, Cnvalue, Csubgraph_isomorphism, J.-C. Régin, Développement d'outils algorithmiques pour l'Intelligence Artificielle Ph. D. Thesis Montpellier II University, France 1995 In French

[Regin96]

sec2, Ccardinality_atleast, Ccardinality_atmost, Cglobal_cardinality, Cglobal_cardinality, Cglobal_cardinality_low_up, Cglobal_cardinality_low_up_no_loop, Cglobal_cardinality_no_loop, Copen_alldifferent, Copen_global_cardinality, Copen_global_cardinality_low_up, J.-C. Régin, Generalized Arc Consistency for Global Cardinality Constraint 14th National Conference on Artificial Intelligence (AAAI-96) 209–215 1996

[Regin97]

Call_min_dist, J.-C. Régin, The Global minimum distance Constraint Technical report ILOG 1997

[Regin99]

sec2, Csymmetric_alldifferent, Csymmetric_alldifferent, Csymmetric_alldifferent, J.-C. Régin, The Symmetric alldiff Constraint 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99) 420–425 1999

[Regin99a]

Cglobal_cardinality_with_costs, Cglobal_cardinality_with_costs, J.-C. Régin, Arc Consistency for Global Cardinality Constraints with Costs Principles and Practice of Constraint Programming (CP'99) LNCS 1713 Springer-Verlag J. Jaffar, 390–404 1999

[ReginGomes04]

Ccolored_matrix, Ccolored_matrix, Ccolored_matrix, Cglobal_cardinality, J.-C. Régin, C. Gomes, The Cardinality Matrix Constraint Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 572–587 2004

[ReginPuget97]

Csliding_distribution, J.-C. Régin, J.-F. Puget, A Filtering Algorithm for Global Sequencing Constraints Principles and Practice of Constraint Programming (CP'97) LNCS 1330 Springer-Verlag G. Smolka, 32–46 1997

[ReginRousseauRueherHoeve10]

Ctree, J.-C. Régin, L.-M. Rousseau, M. Rueher, W.-J. van Hoeve, The Weighted Spanning Tree Constraint Revisited International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 287–291 Bologna, Italy 2010

[ReginRueher00]

sec3.2, J.-C. Régin, M. Rueher, A Global Constraint Combining a Sum Constraint and Difference Constraints Principles and Practice of Constraint Programming (CP'2000) LNCS 1894 Springer-Verlag R. Dechter, 384–395 2000

[ReginRueher05]

sec3.2, J.-C. Régin, M. Rueher, inequality-sum: A Global Constraint Capturing the Objective Function RAIRO Operations Research 2 39 2005 123–139

[ReginRueher99]

sec2, J.-C. Régin, M. Rueher, A Global Constraint Combining a sum Constraint and Binary Inequalities IJCAI-99 Workshop on Non Binary Constraints 1999

[RibeiroCarravilla04]

Cdiffn, C. Ribeiro, M. A. Carravilla, A Global Constraint for Nesting Problems Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'04) LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 256–270 2004

[RichterFreundNaveh06]

Ck_alldifferent, Y. Richter, A. Freund, Y. Naveh, Generalizing Alldifferent: the SomeDifferent Constraint Principles and Practice of Constraint Programming (CP'2006) LNCS 4204 Springer-Verlag F. Benhamou, 468–483 Nantes, France 2006

[Roach84]

Ctwo_orth_are_in_contact, J. A. Roach, The Rectangle Placement Language Technical report 08903 Laboratory for Computer Science Research, Hill Center for the Mathematical Sciences, Busch Campus, Rutgers University, New Brunswick, New Jersey September 1985

[Rochart05]

Calldifferent, G. Rochart, Explications et programmation par contraintes avancée Ph. D. Thesis Nantes University, France 2005 In French

[RochartJussien03]

sec2, Cstretch_circuit, G. Rochart, N. Jussien, Explanations for global constraints: instrumenting the stretch constraint Technical report 03-01-INFO École des Mines de Nantes 2003

[RochonDuVerdier92]

Cdiffn, F. Rochon du Verdier, Résolution de problèmes d'aménagement spatial fondée sur la satisfaction de contraintes. Validation sur l'implantation d'équipements électroniques hyperfréquences Ph. D. Thesis Lyon I University, France July 1992 In French

[Roditty03]

Cdom_reachability, L. Roditty, A faster and simpler fully dynamic transitive closure algorithm SODA'03: Proceedings of the fourteenth anuual ACM-SIAM symposium on Discrete algorithms Springer-Verlag 404–412 2003

[RosaHuang71]

Cmax_occ_of_consecutive_tuples_of_values, A. Rosa, C. Huang, Complete Classification of Solutions to the Problem of 9 Prisoners Proceedings of the 25th Summer Meeting of Canadiant Mathematical Congress 1971

[Roy06]

Calldifferent, B. Roy, Regard historique sur la place de la recherche opérationnelle et de l'aide à la décision en France Mathématiques et sciences humaines 175 2006 25–40 In French, available at http://msh.revues.org/3570

[SadlerGervet01]

Catmost1, Catmost1, A. J. Sadler, C. Gervet, Global reasoning on sets CP'00 Workshop on Modelling and Problem Formulation (FORMUL'01) 2001

[SaidyTaghaviFard08]

Kscheduling_with_machine_choice_calendars_and_preemption, H. R. D. Saidy, M. T. Taghavi-Fard, Study of Scheduling Problems with Machine Availability Constraint Journal of Industrial and Systems Engineering 4 1 2008 360–383

[Samet89]

Ccumulative_two_d, Cdiffn, H. Samet, The design and analysis of spatial data structures Addison-Wesley 1989

[SchausDevilleDupont07]

sec3.2, Kbalanced_assignment, P. Schaus, Y. Deville, P. Dupont, Bound-Consistent Deviation Constraint Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 620–634 2007

[SchausDevilleDupont07a]

Kbalanced_assignment, P. Schaus, Y. Deville, P. Dupont, Bound-Consistent Deviation Slides presented at the Principles and Practice of Constraint Programming (CP'2007) Conference 2007

[SchausDevilleDupontRegin06]

sec3.2, Kbalanced_assignment, P. Schaus, Y. Deville, P. Dupont, J.-C. Régin, Simplification and extension of spread 3th Workshop on Constraint Propagation and Implementation 2006

[SchausDevilleDupontRegin07]

sec3.2, Kbalanced_assignment, P. Schaus, Y. Deville, P. Dupont, J.-C. Régin, The deviation Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'07) LNCS 4150 Springer-Verlag P. Van Hentenryck, L. Wolsey, 260–274 Brussels, Belgium May 2007

[SchausVanHentenryckZanarini10]

sec3.2, P. Schaus, P. Van Hentenryck, A. Zanarini, Revisiting the Soft Global Cardinality Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 307–312 Bologna, Italy 2010

[ScheithauerTerno96]

Kpallet_loading, G. Scheithauer, J. Terno, The G4-Heuristic for the Pallet Loading Problem European Journal of Operational Research 46 1996 511–522

[SchuttWolf10]

Ccumulative, A. Schutt, A. Wolf, A New $O(n^{2}logn)$ Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 445–459 St Andrews, Scotland 2010

[SedgewickFlajolet96]

Cmap, Cmap, R. Sedgewick, O. Flajolet, An introduction to the analysis of algorithms Addison-Wesley 1996

[Sellmann02]

Cminimum_weight_alldifferent, M. Sellmann, An Arc Consistency Algorithm for the Minimum Weight All Different Constraint Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 744–749 2002

[SellmannKadioglu08]

sec3.7.117, M. Sellmann, S. Kadioglu, Dichotomic Search Protocols for Constrained Optimization Principles and Practice of Constraint Programming (CP'2008) LNCS 5202 Springer-Verlag P. J. Stuckey, 251–265 2008

[Shaw04]

Cbin_packing, Cbin_packing, P. Shaw, A Constraint for Bin Packing Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 648–662 2004

[Shearer96]

Cgolomb, J. B. Shearer, Golomb rulers Available at http://www.research.ibm.com/people/s/shearer/grule.html

[ShufetBerliner94]

Ccircuit, J. A. Shufet, H. J. Berliner, Generating hamiltonian circuits without backtracking from errors Theoretical Computer Science 132 1994 347–375

[Sicstus95]

sec3.2, Ccount, Cdiffn, Celement, M. Carlsson, SICStus Prolog User's Manual Swedish Institute of Computer Science 3.10 January 2003 Available at http://www.sics.se/sicstus/

[Simonis01]

Ck_alldifferent, H. Simonis, Building Industrial Application with Constraint Programming Constraints in Computational Logics - Theory and Applications, International Summer School, CCL'99 Gif sur Yvette September 5-8, 1999, France, Revised Lectures Springer-Verlag H. Common, C. Marché, R. Treinen, 271–309 2001

[Simonis05]

Ck_alldifferent, H. Simonis, Sudoku as a Constraint Problem Modelling and Reformulating Constraint Satisfaction Problems, Fourth International Workshop, Sitges (Barcelona), Spain B. Hnich, P. Prosser, B. Smith, 13–27 2005

[Simonis13]

Cglobal_cardinality, H. Simonis, Personal communication June 2013

[Simonis90]

Cconnect_points, H. Simonis, Channel Routing Seen as a Constraint Problem Technical report TR-LP-51 ECRC 1990

[SimonisAggounBeldiceanuBourreau00]

sec2, H. Simonis, A. Aggoun, N. Beldiceanu, É. Bourreau, Complex Constraint Abstraction: Global Constraint Visualization P. Deransart, M. V. Hermenegildo, J. Małuszyński, Analysis and Vizualisation Tools for Constraint Programming LNCS 1870 Springer-Verlag 2000 299–317

[SimonisBourreauBeldiceanu99]

Ksquared_squares, H. Simonis, É. Bourreau, N. Beldiceanu, A Note on Perfect Square Placement Technical report Cosytec 1999

[SimonisCornelissens95]

Kproducer-consumer, H. Simonis, T. Cornelissens, Modelling Producer/Consumer Constraints Principles and Practice of Constraint Programming (CP'95) LNCS 976 Springer-Verlag U. Montanari, F. Rossi, 449–462 1995

[SimonisDavernFeldmanMehtaQuesadaCarlsson10]

sec2, H. Simonis, P. Davern, J. Feldman, D. Mehta, L. Quesada, M. Carlsson, A Generic Visualization Platform for CP Principles and Practice of Constraint Programming (CP'2010) LNCS 6308 Springer-Verlag D. Cohen, 460–474 St Andrews, Scotland 2010

[SimonisSullivan08]

sec3.7.120.2, Ksmallest_rectangle_area, Ksmallest_rectangle_area, H. Simonis, B. O'Sullivan, Search Strategies for Rectangle Packing Principles and Practice of Constraint Programming (CP'2008) LNCS 5202 Springer-Verlag P. J. Stuckey, 52–66 2008

[Skiena90]

sec2.3.2.3, S. Skiena, Implementing Discrete Mathematics. Combinatoric and Graph Theory with Mathematica Addison-Wesley 1990

[Sloane10]

Calldifferent, Ccycle, Ctree, N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences Published electronically at http://oeis.org 2010

[SmithStergiouWalsh99]

Cgolomb, B. M. Smith, K. Stergiou, T. Walsh, Modelling the Golomb Ruler Problem IJCAI-99 Workshop on Non Binary Constraints 1999

[Smolka96]

sec3.1, G. Smolka, Constraints in Oz ACM Computing Surveys 4 28 1996

[SorlinSolnon08]

Cgraph_isomorphism, S. Sorlin, C. Solnon, A Parametric Filtering Algorithm for the Graph Isomorphism Problem Constraints 4 13 December 2008

[Stanley01]

preface, R. P. Stanley, Enumerative Combinatorics 2 Cambridge University Press New York 2001

[Stanley11]

preface, R. P. Stanley, Enumerative Combinatorics 2nd 1 Cambridge University Press New York 2011

[Steel92]

Cstable_compatibility, Cstable_compatibility, M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees Journal of Classification 9 1992 91–116

[StuckeyGarciadelaBandaMaherMarriottSlaneySomogyiWallaceWalsh05]

sec4.5.2.1, P. J. Stuckey, M. J. G. de la Banda, M. J. Maher, K. Marriott, J. K. Slaney, Z. Somogyi, M. G. Wallace, T. Walsh, The G12 Project: Mapping Solver Independent Models to Efficient Solutions Principles and Practice of Constraint Programming (CP'2005) LNCS 3709 Springer-Verlag P. van Beek, 13–16 2005

[Subbarayan05]

Kconfiguration_problem, S. Subbarayan, Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'05) LNCS 3524 Springer-Verlag R. Barták, M. Milano, 351–365 Prague, Czech Republic May/June 2005

[Szczygiel01]

Cdiffn, Cdiffn, T. Szczygiel, CLP Approaches to 2D Angle Placements Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints Prague, Czech Republic June 2001 Available at http://arxiv.org/html/cs/0110012

[Szymanek04]

Cdiffn, R. Szymanek, Constraint-Driven Design Space Exploration for Memory-Dominated Embedded Systems Ph. D. Thesis Lund University, Sweden June 2004

[SzymanekKuchcinski01]

Cdiffn, R. Szymanek, K. Kuchcinski, A Constructive Algorithm for Memory-Aware Task Assignment and Scheduling Proceedings of the Ninth International Symposium on Hardware/Software Codesign Copenhagen 2001

[Tantau12]

sec3.4, T. Tantau, The TikZ & PGF Packages: Manual for version 2.10-cvs 2.10 2012

[Thiel04]

sec2.1.3, Cdiffn, Cweighted_partial_alldiff, Cweighted_partial_alldiff, Cweighted_partial_alldiff, Cweighted_partial_alldiff, Cweighted_partial_alldiff, S. Thiel, Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions Ph. D. Thesis Saarlandes University, Germany 2004

[Tong87]

Kfloor_planning_problem, C. Tong, Toward and Engineering Science of Knowledge-based Design Artificial Intelligence in Engineering 3 2 July 1987 133–166

[Trick02]

Csymmetric_alldifferent, M. A. Trick, Integer and Constraint Programming Approaches for Round Robin Tournament Scheduling Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, Gent, Belgium, August 21-23, 2002, Selected Revised Papers LNCS 2740 Springer-Verlag E. K. Burke, P. D. Causmaecker, 63–77 2003

[Trick03]

Kdynamic_programming, Cbin_packing, M. A. Trick, A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints Annals of Operations Research 1–4 118 2003 73–84

[Turan41]

sec4.3.4.3, P. Turán, On an Extremal Problem in Graph Theory Mat. Fiz. Lapok 48 1941 436–452 In Hungarian

[UedaNagao96]

Klogigraphe, N. Ueda, T. Nagao, NP-completeness Results for NONOGRAM via Parsimonious Reductions Technical report TR96-0008 Department of Computer Science, Tokyo Institute of Technology May 1996

[Ullmann76]

Csubgraph_isomorphism, J. R. Ullmann, An algorithm for subgraph isomorphism J. ACM 1 23 January 1976 31–42

[Valiant79]

sec2.1.7, Calldifferent, L. G. Valiant, The complexity of computing the permanent Theoretical Computer Science 8 1979 189–201

[VanHentenryck89]

Cglobal_cardinality, P. Van Hentenryck, Constraint Satisfaction in Logic Programming MIT Press 1989

[VanHentenryck94]

Ksquared_squares, P. Van Hentenryck, Scheduling and Packing in the Constraint Language cc(FD) Intelligent Scheduling Morgan Kaufmann Publishers M. Zweben, M. Fox, 1994

[VanHentenryck99]

sec4.5.2.1, P. Van Hentenryck, The OPL Optimization Programming Language MIT Press 1999

[VanHentenryckCarillon88]

sec2.4.1, Celement, P. Van Hentenryck, J.-P. Carillon, Generality vs. Specificity: an Experience with AI and OR Techniques National Conference on Artificial Intelligence (AAAI-88) 1988

[VanHentenryckDeville91]

Ksweep, P. Van Hentenryck, Y. Deville, The Cardinality Operator: a New Logical Connective in Constraint Logic Programming Int. Conf. on Logic Programming (ICLP'91) MIT Press 1991

[VanHentenryckSaraswatDeville95]

sec3.7.59, P. Van Hentenryck, V. Saraswat, Y. Deville, Design, Implementation and Evaluation of the Constraint Language cc(FD) Constraints: Basics and Trends LNCS 910 Springer-Verlag A. Podelski, 293–316 1995

[Vellino90]

KCostas_arrays, A. Vellino, Costas Arrays Technical report 90079 Computing Research Laboratory, Bell-Northern Research 1990

[Vempaty92]

preface, N. R. Vempaty, Solving Constraint Satisfaction Problems using Finite State Automata National Conference on Artificial Intelligence (AAAI-92) AAAI Press 453–458 1992

[Vilim04]

KPhi_tree, Cdisjunctive, P. Vilím, $O(nlogn)$ Filtering Algorithms for Unary Resource Constraint Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'04) LNCS 3011 Springer-Verlag J.-C. Régin, M. Rueher, 335–347 2004

[Vilim07]

KPhi_tree, P. Vilím, Global Constraints in Scheduling Ph. D. Thesis Charles University, Prague, Department of Theoretical Computer Science and Mathematical Logic, Czech Republic 2007

[Vilim09a]

KPhi_tree, KPhi_tree, KPhi_tree, Ccumulative, P. Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09) LNCS 5547 Springer-Verlag W.-J. van Hoeve, J. N. Hooker, 294–308 Pittsburgh, PA, USA 2009

[Vilim09b]

KPhi_tree, Ccumulative, P. Vilím, Edge Finding Filtering Algorithm for Discrete Cumulative Resources in $O(knlogn)$ Principles and Practice of Constraint Programming (CP'2009) LNCS 5732 Springer-Verlag I. P. Gent, 802–816 2009

[Voss07]

sec3.4, H. Voß, PSTricks - Grafik für TeX und LaTeX Lehmanns Media Berlin 2007 Vierte Auflage

[WallaceWilson06]

Ccond_lex_cost, Ccond_lex_cost, Ccond_lex_greater, Ccond_lex_greatereq, Ccond_lex_less, Ccond_lex_lesseq, R. J. Wallace, N. Wilson, Conditional Lexicographic Orders in Constraint Satisfaction Problems International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 258–272 Cork, Ireland May 2006

[Walsh06]

Cint_value_precede_chain, T. Walsh, Symmetry Breaking using Value Precedence ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings IOS Press 168–172 2006

[Walsh07]

Cint_value_precede_chain, T. Walsh, Breaking Value Symmetry Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 880–888 2007

[Watkins04]

Calldifferent, J. J. Watkins, Across the Board: The Mathematics of Chessboard Problems Princeton University Press Princeton and Oxford 2004

[WilliamsYan01]

Calldifferent, H. P. Williams, H. Yan, Representations of the alldifferent Predicate of Constraint Satisfaction in Integer Programming INFORMS Journal on Computing 2 13 2001 96–103

[Wolf05]

Cdisjunctive, A. Wolf, Better Propagation for Non-preemptive Single-Resource Constraint Problems Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004; Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers LNCS 3419 Springer-Verlag B. Faltings, A. Petcu, F. Fages, F. Rossi, 201–215 2005

[WurtzMuller96]

sec3.7.59, J. Würtz, T. Müller, Constructive Disjunction Revisited 20th German Annual Conference on Artificial Intelligence LNAI 1137 Springer-Verlag G. Görz, S. Hölldobler, 377–386 Dresden, Germany 1996

[XCSP2008]

sec4.5.2.1, O. C. of the Third International Competition of CSP Solvers, XML Representation of Constraint Networks Format XCSP 2.1 2008 Available at http://www.cril.univ-artois.fr/CPAI08/XCSP2_1.pdf

[YatChiuLawJimmyLee04]

Cint_value_precede, Cint_value_precede, Cint_value_precede_chain, Cset_value_precede, Cset_value_precede, Y. C. Law, J. H. Lee, Global Constraints for Integer and Set Value Precedence Principles and Practice of Constraint Programming (CP'2004) LNCS 3258 Springer-Verlag M. G. Wallace, 362–376 2004

[Yunes02]

Csum, Csum, T. H. Yunes, On the Sum Constraint: Relaxation and Applications Principles and Practice of Constraint Programming (CP'2002) LNCS 2470 Springer-Verlag P. Van Hentenryck, 80–92 2002

[ZampelliDevilleSolnonSorlinDupont07]

Csubgraph_isomorphism, S. Zampelli, Y. Deville, C. Solnon, S. Sorlin, P. Dupont, Filtering for Subgraph Isomorphism Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 728–742 2007

[ZanariniMilanoPesant06]

sec3.2, sec3.2, A. Zanarini, M. Milano, G. Pesant, Improved Algorithm for the Soft Global Cardinality Constraint International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'06) LNCS 3990 Springer-Verlag J. C. Beck, B. Smith, 288–299 Cork, Ireland May 2006

[ZanariniPesant07b]

Calldifferent, A. Zanarini, G. Pesant, Solution Counting Algorithms for Constraint-Centered Search Heuristics Principles and Practice of Constraint Programming (CP'2007) LNCS 4741 Springer-Verlag C. Bessière, 743–757 2007

[ZanariniPesant10]

sec2.1.7, Calldifferent, A. Zanarini, G. Pesant, More Robust Counting-Based Heuristics with Alldifferent Constraints International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'10) LNCS 6140 Springer-Verlag A. Lodi, M. Milano, P. Toth, 354–368 Bologna, Italy 2010

[Zhou96]

Cconnect_points, N.-F. Zhou, Channel Routing with Constraint Logic Programming and Delay 9th Int. Conf. on Industrial Applications of AI Gordon and Breach Science Publishers 217–231 1996

[Zhou97]

Csort, Csort_permutation, Csort_permutation, J. Zhou, A Permutation-Based Approach for Solving the Job-Shop Problem Constraints 2 2 1997 185–213

[ZimmermannCunningham91]

sec2, W. Zimmermann, S. Cunningham, Editors' introduction: What is mathematical visualization? Visualization in teaching and learning mathematics Mathematical Association of America 1–8 1991

[vanHoeve05]

Cdiscrepancy, Cdiscrepancy, Csame, Csoft_same_var, Csoft_same_var, W.-J. van Hoeve, Operations Research Techniques in Constraint Programming Ph. D. Thesis Amsterdam University, CWI, Netherlands 2005