Table of Contents
- 1. Getting started
- 2. Describing Global Constraints
- 2.1. Describing the arguments of a global constraint
- 2.1.1. Basic data types
- 2.1.2. Compound data types
- 2.1.3. Restrictions
- 2.1.4. Declaring a global constraint
- 2.1.5. Describing symmetries between arguments
- 2.2. Describing global constraints in terms of graph properties
- 2.2.1. Basic ideas and illustrative example
- 2.2.2. Ingredients used for describing global constraints
- 2.2.2.1. Collection generators
- 2.2.2.2. Elementary constraints attached to the arcs
- 2.2.2.3. Graph generators
- 2.2.2.4. Graph properties
- 2.2.3. Graph constraint
- 2.2.3.1. Simple graph constraint
- 2.2.3.2. Dynamic graph constraint
- 2.3. Describing global constraints in terms of automata
- 2.4. Reformulating global constraints as a conjunction
- 2.5. Semantic links between global constraints
- 2.5.1. Assignment dimension added
- 2.5.2. Assignment dimension removed
- 2.5.3. Attached to cost variant
- 2.5.4. Common keyword
- 2.5.5. Comparison swapped
- 2.5.6. Cost variant
- 2.5.7. Generalisation
- 2.5.8. Hard version
- 2.5.9. Implied by
- 2.5.10. Implies
- 2.5.11. Implies if swap arguments
- 2.5.12. Negation
- 2.5.13. Part of system of constraints
- 2.5.14. Related
- 2.5.15. Related to a common problem
- 2.5.16. Root concept
- 2.5.17. Shift of concept
- 2.5.18. Soft variant
- 2.5.19. Specialisation
- 2.5.20. System of constraints
- 2.5.21. Used in graph description
- 2.5.22. Used in reformulation
- 2.5.23. Uses in its reformulation
- 2.1. Describing the arguments of a global constraint
- 3. Description of the Catalogue
- 3.1. Which global constraints are included?
- 3.2. Which global constraints are missing?
- 3.3. Searching in the catalogue
- 3.4. Figures of the catalogue
- 3.5. Constraints argument patterns
- 3.5.1. Constraints with 1 argument
- 3.5.2. Constraints with 2 arguments
- 3.5.3. Constraints with 3 arguments
- 3.5.4. Constraints with 4 arguments
- 3.5.5. Constraints with 5 arguments
- 3.5.6. Constraints with 6 arguments
- 3.5.7. Constraints with 8 arguments
- 3.5.8. Constraints with 10 arguments
- 3.6. Meta-keywords attached to the keywords
- 3.6.1. Application area
- 3.6.2. Characteristic of a constraint
- 3.6.3. Combinatorial object
- 3.6.4. Complexity
- 3.6.5. Constraint network structure
- 3.6.6. Constraint type
- 3.6.7. Constraint arguments
- 3.6.8. Filtering
- 3.6.9. Final graph structure
- 3.6.10. Geometry
- 3.6.11. Heuristics
- 3.6.12. Miscellaneous
- 3.6.13. Modelling
- 3.6.14. Modelling exercises
- 3.6.15. Problems
- 3.6.16. Puzzles
- 3.6.17. Symmetry
- 3.7. Keywords attached to the global constraints
- 3.7.1. 3-dimensional-matching
- 3.7.2. 3-SAT
- 3.7.3. Abstract interpretation
- 3.7.4. Acyclic
- 3.7.5. Air traffic management
- 3.7.6. Alignment
- 3.7.7. All different
- 3.7.8. Alpha-acyclic constraint network(2)
- 3.7.9. Alpha-acyclic constraint network(3)
- 3.7.10. Apartition
- 3.7.11. Arc-consistency
- 3.7.12. Arithmetic constraint
- 3.7.13. Array constraint
- 3.7.14. Assigning and scheduling tasks that run in parallel
- 3.7.15. Assignment
- 3.7.16. Assignment dimension
- 3.7.17. Assignment to the same set of values
- 3.7.18. At least
- 3.7.19. At most
- 3.7.20. Automaton
- 3.7.21. Automaton with array of counters
- 3.7.22. Automaton with counters
- 3.7.23. Automaton without counters
- 3.7.24. Autoref
- 3.7.25. Balanced assignment
- 3.7.26. Balanced tree
- 3.7.27. Berge-acyclic constraint network
- 3.7.28. Binary constraint
- 3.7.29. Bioinformatics
- 3.7.30. Bipartite
- 3.7.31. Bipartite matching
- 3.7.32. Bipartite matching in convex bipartite graphs
- 3.7.33. Boolean channel
- 3.7.34. Boolean constraint
- 3.7.35. Border
- 3.7.36. Bound-consistency
- 3.7.37. Business rules
- 3.7.38. Centered cyclic(1) constraint network(1)
- 3.7.39. Centered cyclic(2) constraint network(1)
- 3.7.40. Centered cyclic(3) constraint network(1)
- 3.7.41. Channel routing
- 3.7.42. Channelling constraint
- 3.7.43. Circuit
- 3.7.44. Circular sliding cyclic(1) constraint network(2)
- 3.7.45. Cluster
- 3.7.46. Coloured
- 3.7.47. Compulsory part
- 3.7.48. Conditional constraint
- 3.7.49. Configuration problem
- 3.7.50. Connected component
- 3.7.51. Consecutive loops are connected
- 3.7.52. Consecutive values
- 3.7.53. Constraint between two collections of variables
- 3.7.54. Constraint between three collections of variables
- 3.7.55. Constraint involving set variables
- 3.7.56. Constraint on the intersection
- 3.7.57. Constructive disjunction
- 3.7.58. Contact
- 3.7.59. Convex
- 3.7.60. Convex bipartite graph
- 3.7.61. Convex hull relaxation
- 3.7.62. Conway packing problem
- 3.7.63. Core
- 3.7.64. Costas arrays
- 3.7.65. Cost filtering constraint
- 3.7.66. Cost matrix
- 3.7.67. Counting constraint
- 3.7.68. Cumulative longest hole problems
- 3.7.69. Cycle
- 3.7.70. Cyclic
- 3.7.71. Data constraint
- 3.7.72. Deadlock breaking
- 3.7.73. Decomposition
- 3.7.74. Decomposition-based violation measure
- 3.7.75. DFS-bottleneck
- 3.7.76. Demand profile
- 3.7.77. Degree of diversity of a set of solutions
- 3.7.78. Derived collection
- 3.7.79. Difference
- 3.7.80. Difference between pairs of variables
- 3.7.81. Directed acyclic graph
- 3.7.82. Disequality
- 3.7.83. Disjunction
- 3.7.84. Domain channel
- 3.7.85. Domain definition
- 3.7.86. Dominating queens
- 3.7.87. Domination
- 3.7.88. Dual model
- 3.7.89. Duplicated variables
- 3.7.90. Dynamic programming
- 3.7.91. Empty intersection
- 3.7.92. Entailment
- 3.7.93. Equality
- 3.7.94. Equality between multisets
- 3.7.95. Equivalence
- 3.7.96. Euler knight
- 3.7.97. Excluded
- 3.7.98. Extension
- 3.7.99. Facilities location problem
- 3.7.100. Floor planning problem
- 3.7.101. Flow
- 3.7.101.1. Flow models for ,
- 3.7.101.2. Flow models for ,
- 3.7.101.3. Flow models for ,
- 3.7.101.4. Flow model for
- 3.7.102. Frequency allocation problem
- 3.7.103. Functional dependency
- 3.7.104. Geometrical constraint
- 3.7.105. Golomb ruler
- 3.7.106. Graph colouring
- 3.7.107. Graph constraint
- 3.7.108. Graph partitioning constraint
- 3.7.109. Guillotine cut
- 3.7.110. Hall interval
- 3.7.111. Hamiltonian
- 3.7.112. Heuristics
- 3.7.113. Heuristics and Berge-acyclic constraint network
- 3.7.114. Heuristics and lexicographical ordering
- 3.7.115. Heuristics for two-dimensional rectangle placement problems
- 3.7.116. Hungarian method for the assignment problem
- 3.7.117. Hybrid-consistency
- 3.7.118. Hypergraph
- 3.7.119. Included
- 3.7.120. Inclusion
- 3.7.121. Incompatible pairs of values
- 3.7.122. Indistinguishable values
- 3.7.123. Interval
- 3.7.124. Joker value
- 3.7.125. Klee's measure problem
- 3.7.126. Latin square
- 3.7.127. Lexicographic order
- 3.7.128. Limited discrepancy search
- 3.7.129. Linear programming
- 3.7.130. Line-segments intersection
- 3.7.131. Logic
- 3.7.132. Logigraphe
- 3.7.133. Magic hexagon
- 3.7.134. Magic series
- 3.7.135. Magic square
- 3.7.136. Matching
- 3.7.137. Matrix
- 3.7.138. Matrix model
- 3.7.139. Matrix symmetry
- 3.7.140. Maximum
- 3.7.141. Maximum clique
- 3.7.142. Maximum number of occurrences
- 3.7.143. maxint
- 3.7.144. Metro
- 3.7.145. Minimum
- 3.7.146. Minimum cost flow
- 3.7.147. Minimum feedback vertex set
- 3.7.148. Minimum hitting set cardinality
- 3.7.149. Minimum number of occurrences
- 3.7.150. Modulo
- 3.7.151. Multiset
- 3.7.152. Multiset ordering
- 3.7.153. No cycle
- 3.7.154. No loop
- 3.7.155. n-Amazon
- 3.7.156. n-queen
- 3.7.157. Non-deterministic automaton
- 3.7.158. Non-overlapping
- 3.7.159. Number of changes
- 3.7.160. Number of distinct equivalence classes
- 3.7.161. Number of distinct values
- 3.7.162. Obscure
- 3.7.163. One succ
- 3.7.164. Open automaton constraint
- 3.7.165. Open constraint
- 3.7.166. Order constraint
- 3.7.167. Orthotope
- 3.7.168. Overlapping alldifferent
- 3.7.169. Pair
- 3.7.170. Packing almost squares
- 3.7.171. Pallet loading
- 3.7.172. Partition
- 3.7.173. Path
- 3.7.174. Partridge
- 3.7.175. Pattern sequencing
- 3.7.176. Pentomino
- 3.7.177. Periodic
- 3.7.178. Permutation
- 3.7.179. Permutation channel
- 3.7.180. Phi-tree
- 3.7.181. Phylogeny
- 3.7.182. Pick-up delivery
- 3.7.183. Planarity test
- 3.7.184. Polygon
- 3.7.185. Positioning constraint
- 3.7.186. Predefined constraint
- 3.7.187. Preferences
- 3.7.188. Producer-consumer
- 3.7.189. Product
- 3.7.190. Program verification
- 3.7.191. Proximity constraint
- 3.7.192. Quadtree
- 3.7.193. Range
- 3.7.194. Rank
- 3.7.195. RCC8
- 3.7.196. Reified automaton constraint
- 3.7.197. Reified constraint
- 3.7.198. Relation
- 3.7.199. Relaxation
- 3.7.200. Relaxation dimension
- 3.7.201. Rectangle clique partition
- 3.7.202. Resource constraint
- 3.7.203. Run of a permutation
- 3.7.204. SAT
- 3.7.205. Scalar product
- 3.7.206. Sequence
- 3.7.207. Sequence dependent set-up
- 3.7.208. Sequencing with release times and deadlines
- 3.7.209. Set channel
- 3.7.210. Set packing
- 3.7.211. Shikaku
- 3.7.212. Scheduling constraint
- 3.7.213. Scheduling with machine choice, calendars and preemption
- 3.7.214. Shared table
- 3.7.215. Schur number
- 3.7.216. SLAM problem
- 3.7.217. Sliding cyclic(1) constraint network(1)
- 3.7.218. Sliding cyclic(1) constraint network(2)
- 3.7.219. Sliding cyclic(1) constraint network(3)
- 3.7.220. Sliding cyclic(2) constraint network(2)
- 3.7.221. Sliding sequence constraint
- 3.7.222. Smallest square for packing consecutive dominoes
- 3.7.223. Smallest rectangle area
- 3.7.224. Smallest square for packing rectangles with distinct sizes
- 3.7.225. Soft constraint
- 3.7.226. Sort
- 3.7.227. Sparse functional dependency
- 3.7.228. Sparse table
- 3.7.229. Sport timetabling
- 3.7.230. Squared squares
- 3.7.231. Statistics
- 3.7.232. Strip packing
- 3.7.233. Strong bridge
- 3.7.234. Strong articulation point
- 3.7.235. Strongly connected component
- 3.7.236. Subset sum
- 3.7.237. Sudoku
- 3.7.238. Sum
- 3.7.239. Sweep
- 3.7.240. Symmetry
- 3.7.241. Symmetric
- 3.7.242. System of constraints
- 3.7.243. Table
- 3.7.244. Temporal constraint
- 3.7.245. Ternary constraint
- 3.7.246. Timetabling constraint
- 3.7.247. Time window
- 3.7.248. Touch
- 3.7.249. Tree
- 3.7.250. Tuple
- 3.7.251. Two-dimensional orthogonal packing
- 3.7.252. Unary constraint
- 3.7.253. Undirected graph
- 3.7.254. Value constraint
- 3.7.255. Value partitioning constraint
- 3.7.256. Value precedence
- 3.7.257. Variable-based violation measure
- 3.7.258. Variable indexing
- 3.7.259. Variable subscript
- 3.7.260. Vector
- 3.7.261. Vpartition
- 3.7.262. Weighted assignment
- 3.7.263. Workload covering
- 3.7.264. Zebra puzzle
- 3.7.265. Zero-duration task
- 4. Further Topics
- 4.1. Differences from the 2000 report
- 4.2. Differences from the 2005 report
- 4.3. Graph invariants
- 4.3.1. Graph classes
- 4.3.2. Format of an invariant
- 4.3.3. Using the database of invariants
- 4.3.4. The database of graph invariants
- 4.3.4.1. one parameter/one final graph
- 4.3.4.2. two parameters/one final graph
- 4.3.4.3. three parameters/one final graph
- 4.3.4.4. four parameters/one final graph
- 4.3.4.5. five parameters/one final graph
- 4.3.4.6. two parameters/two final graphs
- 4.3.4.7. three parameters/two final graphs
- 4.3.4.8. four parameters/two final graphs
- 4.3.4.9. five parameters/two final graphs
- 4.3.4.10. six parameters/two final graphs
- 4.4. The electronic version of the catalogue
- 4.4.1. Prolog facts describing a constraint
- 4.4.2. XML schema associated with a global constraint
- 4.4.2.1. Related work
- 4.4.2.2. Key features
- 4.4.2.3. Structure of schema
- 4.4.2.4. Generating schema from the catalogue
- 4.4.2.5. Conclusion
- 5. Global Constraint Catalogue
- 5.1. abs_value
- 5.2. all_differ_from_at_least_k_pos
- 5.3. all_equal
- 5.4. all_min_dist
- 5.5. alldifferent
- 5.6. alldifferent_between_sets
- 5.7. alldifferent_consecutive_values
- 5.8. alldifferent_cst
- 5.9. alldifferent_except_0
- 5.10. alldifferent_interval
- 5.11. alldifferent_modulo
- 5.12. alldifferent_on_intersection
- 5.13. alldifferent_partition
- 5.14. alldifferent_same_value
- 5.15. allperm
- 5.16. among
- 5.17. among_diff_0
- 5.18. among_interval
- 5.19. among_low_up
- 5.20. among_modulo
- 5.21. among_seq
- 5.22. among_var
- 5.23. and
- 5.24. arith
- 5.25. arith_or
- 5.26. arith_sliding
- 5.27. assign_and_counts
- 5.28. assign_and_nvalues
- 5.29. atleast
- 5.30. atleast_nvalue
- 5.31. atleast_nvector
- 5.32. atmost
- 5.33. atmost1
- 5.34. atmost_nvalue
- 5.35. atmost_nvector
- 5.36. balance
- 5.37. balance_interval
- 5.38. balance_modulo
- 5.39. balance_partition
- 5.40. between_min_max
- 5.41. bin_packing
- 5.42. bin_packing_capa
- 5.43. binary_tree
- 5.44. bipartite
- 5.45. calendar
- 5.46. cardinality_atleast
- 5.47. cardinality_atmost
- 5.48. cardinality_atmost_partition
- 5.49. change
- 5.50. change_continuity
- 5.51. change_pair
- 5.52. change_partition
- 5.53. circuit
- 5.54. circuit_cluster
- 5.55. circular_change
- 5.56. clause_and
- 5.57. clause_or
- 5.58. clique
- 5.59. colored_matrix
- 5.60. coloured_cumulative
- 5.61. coloured_cumulatives
- 5.62. common
- 5.63. common_interval
- 5.64. common_modulo
- 5.65. common_partition
- 5.66. cond_lex_cost
- 5.67. cond_lex_greater
- 5.68. cond_lex_greatereq
- 5.69. cond_lex_less
- 5.70. cond_lex_lesseq
- 5.71. connect_points
- 5.72. connected
- 5.73. consecutive_groups_of_ones
- 5.74. consecutive_values
- 5.75. contains_sboxes
- 5.76. correspondence
- 5.77. count
- 5.78. counts
- 5.79. coveredby_sboxes
- 5.80. covers_sboxes
- 5.81. crossing
- 5.82. cumulative
- 5.83. cumulative_convex
- 5.84. cumulative_product
- 5.85. cumulative_two_d
- 5.86. cumulative_with_level_of_priority
- 5.87. cumulatives
- 5.88. cutset
- 5.89. cycle
- 5.90. cycle_card_on_path
- 5.91. cycle_or_accessibility
- 5.92. cycle_resource
- 5.93. cyclic_change
- 5.94. cyclic_change_joker
- 5.95. dag
- 5.96. decreasing
- 5.97. deepest_valley
- 5.98. derangement
- 5.99. differ_from_at_least_k_pos
- 5.100. diffn
- 5.101. diffn_column
- 5.102. diffn_include
- 5.103. discrepancy
- 5.104. disj
- 5.105. disjoint
- 5.106. disjoint_sboxes
- 5.107. disjoint_tasks
- 5.108. disjunctive
- 5.109. distance
- 5.110. distance_between
- 5.111. distance_change
- 5.112. dom_reachability
- 5.113. domain
- 5.114. domain_constraint
- 5.115. elem
- 5.116. elem_from_to
- 5.117. element
- 5.118. element_greatereq
- 5.119. element_lesseq
- 5.120. element_matrix
- 5.121. element_product
- 5.122. element_sparse
- 5.123. elementn
- 5.124. elements
- 5.125. elements_alldifferent
- 5.126. elements_sparse
- 5.127. eq
- 5.128. eq_cst
- 5.129. eq_set
- 5.130. equal_sboxes
- 5.131. equivalent
- 5.132. exactly
- 5.133. gcd
- 5.134. geost
- 5.135. geost_time
- 5.136. geq
- 5.137. geq_cst
- 5.138. global_cardinality
- 5.139. global_cardinality_low_up
- 5.140. global_cardinality_low_up_no_loop
- 5.141. global_cardinality_no_loop
- 5.142. global_cardinality_with_costs
- 5.143. global_contiguity
- 5.144. golomb
- 5.145. graph_crossing
- 5.146. graph_isomorphism
- 5.147. group
- 5.148. group_skip_isolated_item
- 5.149. gt
- 5.150. highest_peak
- 5.151. imply
- 5.152. in
- 5.153. in_interval
- 5.154. in_interval_reified
- 5.155. in_intervals
- 5.156. in_relation
- 5.157. in_same_partition
- 5.158. in_set
- 5.159. increasing
- 5.160. increasing_global_cardinality
- 5.161. increasing_nvalue
- 5.162. increasing_nvalue_chain
- 5.163. indexed_sum
- 5.164. inflexion
- 5.165. inside_sboxes
- 5.166. int_value_precede
- 5.167. int_value_precede_chain
- 5.168. interval_and_count
- 5.169. interval_and_sum
- 5.170. inverse
- 5.171. inverse_offset
- 5.172. inverse_set
- 5.173. inverse_within_range
- 5.174. ith_pos_different_from_0
- 5.175. k_alldifferent
- 5.176. k_cut
- 5.177. k_disjoint
- 5.178. k_same
- 5.179. k_same_interval
- 5.180. k_same_modulo
- 5.181. k_same_partition
- 5.182. k_used_by
- 5.183. k_used_by_interval
- 5.184. k_used_by_modulo
- 5.185. k_used_by_partition
- 5.186. length_first_sequence
- 5.187. length_last_sequence
- 5.188. leq
- 5.189. leq_cst
- 5.190. lex2
- 5.191. lex_alldifferent
- 5.192. lex_between
- 5.193. lex_chain_less
- 5.194. lex_chain_lesseq
- 5.195. lex_different
- 5.196. lex_equal
- 5.197. lex_greater
- 5.198. lex_greatereq
- 5.199. lex_less
- 5.200. lex_lesseq
- 5.201. lex_lesseq_allperm
- 5.202. link_set_to_booleans
- 5.203. longest_change
- 5.204. lt
- 5.205. map
- 5.206. max_index
- 5.207. max_n
- 5.208. max_nvalue
- 5.209. max_size_set_of_consecutive_var
- 5.210. maximum
- 5.211. maximum_modulo
- 5.212. meet_sboxes
- 5.213. min_index
- 5.214. min_n
- 5.215. min_nvalue
- 5.216. min_size_set_of_consecutive_var
- 5.217. minimum
- 5.218. minimum_except_0
- 5.219. minimum_greater_than
- 5.220. minimum_modulo
- 5.221. minimum_weight_alldifferent
- 5.222. nand
- 5.223. nclass
- 5.224. neq
- 5.225. neq_cst
- 5.226. nequivalence
- 5.227. next_element
- 5.228. next_greater_element
- 5.229. ninterval
- 5.230. no_peak
- 5.231. no_valley
- 5.232. non_overlap_sboxes
- 5.233. nor
- 5.234. not_all_equal
- 5.235. not_in
- 5.236. npair
- 5.237. nset_of_consecutive_values
- 5.238. nvalue
- 5.239. nvalue_on_intersection
- 5.240. nvalues
- 5.241. nvalues_except_0
- 5.242. nvector
- 5.243. nvectors
- 5.244. open_alldifferent
- 5.245. open_among
- 5.246. open_atleast
- 5.247. open_atmost
- 5.248. open_global_cardinality
- 5.249. open_global_cardinality_low_up
- 5.250. open_maximum
- 5.251. open_minimum
- 5.252. opposite_sign
- 5.253. or
- 5.254. orchard
- 5.255. ordered_atleast_nvector
- 5.256. ordered_atmost_nvector
- 5.257. ordered_global_cardinality
- 5.258. ordered_nvector
- 5.259. orth_link_ori_siz_end
- 5.260. orth_on_the_ground
- 5.261. orth_on_top_of_orth
- 5.262. orths_are_connected
- 5.263. overlap_sboxes
- 5.264. path
- 5.265. path_from_to
- 5.266. pattern
- 5.267. peak
- 5.268. period
- 5.269. period_except_0
- 5.270. place_in_pyramid
- 5.271. polyomino
- 5.272. power
- 5.273. product_ctr
- 5.274. proper_forest
- 5.275. range_ctr
- 5.276. relaxed_sliding_sum
- 5.277. roots
- 5.278. same
- 5.279. same_and_global_cardinality
- 5.280. same_and_global_cardinality_low_up
- 5.281. same_intersection
- 5.282. same_interval
- 5.283. same_modulo
- 5.284. same_partition
- 5.285. same_sign
- 5.286. scalar_product
- 5.287. sequence_folding
- 5.288. set_value_precede
- 5.289. shift
- 5.290. size_max_seq_alldifferent
- 5.291. size_max_starting_seq_alldifferent
- 5.292. sliding_card_skip0
- 5.293. sliding_distribution
- 5.294. sliding_sum
- 5.295. sliding_time_window
- 5.296. sliding_time_window_from_start
- 5.297. sliding_time_window_sum
- 5.298. smooth
- 5.299. soft_all_equal_max_var
- 5.300. soft_all_equal_min_ctr
- 5.301. soft_all_equal_min_var
- 5.302. soft_alldifferent_ctr
- 5.303. soft_alldifferent_var
- 5.304. soft_cumulative
- 5.305. soft_same_interval_var
- 5.306. soft_same_modulo_var
- 5.307. soft_same_partition_var
- 5.308. soft_same_var
- 5.309. soft_used_by_interval_var
- 5.310. soft_used_by_modulo_var
- 5.311. soft_used_by_partition_var
- 5.312. soft_used_by_var
- 5.313. sort
- 5.314. sort_permutation
- 5.315. stable_compatibility
- 5.316. stage_element
- 5.317. stretch_circuit
- 5.318. stretch_path
- 5.319. stretch_path_partition
- 5.320. strict_lex2
- 5.321. strictly_decreasing
- 5.322. strictly_increasing
- 5.323. strongly_connected
- 5.324. subgraph_isomorphism
- 5.325. sum
- 5.326. sum_ctr
- 5.327. sum_free
- 5.328. sum_of_weights_of_distinct_values
- 5.329. sum_set
- 5.330. symmetric
- 5.331. symmetric_alldifferent
- 5.332. symmetric_cardinality
- 5.333. symmetric_gcc
- 5.334. temporal_path
- 5.335. tour
- 5.336. track
- 5.337. tree
- 5.338. tree_range
- 5.339. tree_resource
- 5.340. two_layer_edge_crossing
- 5.341. two_orth_are_in_contact
- 5.342. two_orth_column
- 5.343. two_orth_do_not_overlap
- 5.344. two_orth_include
- 5.345. used_by
- 5.346. used_by_interval
- 5.347. used_by_modulo
- 5.348. used_by_partition
- 5.349. uses
- 5.350. valley
- 5.351. vec_eq_tuple
- 5.352. visible
- 5.353. weighted_partial_alldiff
- 5.354. xor
- 6. Legend for the Description
- 6.1. Restrictions
- 6.2. Arc generators
- 6.3. Graph parameters
- 6.4. Set generators