Table of Contents
- 1. Getting started
- 2. Describing Global Constraints
- 2.1. Global constraint: what it is, and what it is not
- 2.1.1. Checker view
- 2.1.2. Feasibility view
- 2.1.3. Filtering view
- 2.1.4. Explanation view
- 2.1.5. Cost violation view
- 2.1.6. Reification view
- 2.1.7. Counting view
- 2.1.8. Property view
- 2.2. Describing the arguments of a global constraint
- 2.2.1. Basic data types
- 2.2.2. Compound data types
- 2.2.3. Restrictions
- 2.2.4. Declaring a global constraint
- 2.2.5. Describing symmetries between arguments
- 2.3. Describing global constraints in terms of graph properties
- 2.3.1. Basic ideas and illustrative example
- 2.3.2. Ingredients used for describing global constraints
- 2.3.2.1. Collection generators
- 2.3.2.2. Elementary constraints attached to the arcs
- 2.3.2.3. Graph generators
- 2.3.2.4. Graph properties
- 2.3.3. Graph constraint
- 2.3.3.1. Simple graph constraint
- 2.3.3.2. Dynamic graph constraint
- 2.4. Describing global constraints in terms of automata
- 2.5. Reformulating global constraints as a conjunction
- 2.6. Semantic links between global constraints
- 2.6.1. Assignment dimension added
- 2.6.2. Assignment dimension removed
- 2.6.3. Attached to cost variant
- 2.6.4. Common keyword
- 2.6.5. Comparison swapped
- 2.6.6. Cost variant
- 2.6.7. Generalisation
- 2.6.8. Hard version
- 2.6.9. Implied by
- 2.6.10. Implies
- 2.6.11. Implies (if swap arguments)
- 2.6.12. Implies (items to collection)
- 2.6.13. Negation
- 2.6.14. Part of system of constraints
- 2.6.15. Related
- 2.6.16. Related to a common problem
- 2.6.17. Root concept
- 2.6.18. Shift of concept
- 2.6.19. Soft variant
- 2.6.20. Specialisation
- 2.6.21. System of constraints
- 2.6.22. Used in graph description
- 2.6.23. Used in reformulation
- 2.6.24. Uses in its reformulation
- 2.1. Global constraint: what it is, and what it is not
- 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. Aggregate
- 3.7.6. Air traffic management
- 3.7.7. Alignment
- 3.7.8. All different
- 3.7.9. Alpha-acyclic constraint network(2)
- 3.7.10. Alpha-acyclic constraint network(3)
- 3.7.11. Apartition
- 3.7.12. Arc-consistency
- 3.7.13. Arithmetic constraint
- 3.7.14. Array constraint
- 3.7.15. Assigning and scheduling tasks that run in parallel
- 3.7.16. Assignment
- 3.7.17. Assignment dimension
- 3.7.18. Assignment to the same set of values
- 3.7.19. At least
- 3.7.20. At most
- 3.7.21. Automaton
- 3.7.22. Automaton with array of counters
- 3.7.23. Automaton with counters
- 3.7.24. Automaton with same input symbol
- 3.7.25. Automaton without counters
- 3.7.26. Autoref
- 3.7.27. Balanced assignment
- 3.7.28. Balanced tree
- 3.7.29. Berge-acyclic constraint network
- 3.7.30. Binary constraint
- 3.7.31. Bioinformatics
- 3.7.32. Bipartite
- 3.7.33. Bipartite matching
- 3.7.34. Bipartite matching in convex bipartite graphs
- 3.7.35. Boolean channel
- 3.7.36. Boolean constraint
- 3.7.37. Border
- 3.7.38. Bound-consistency
- 3.7.39. Business rules
- 3.7.40. Centered cyclic(1) constraint network(1)
- 3.7.41. Centered cyclic(2) constraint network(1)
- 3.7.42. Centered cyclic(3) constraint network(1)
- 3.7.43. Channel routing
- 3.7.44. Channelling constraint
- 3.7.45. Circuit
- 3.7.46. Circular sliding cyclic(1) constraint network(2)
- 3.7.47. Cluster
- 3.7.48. Coloured
- 3.7.49. Compulsory part
- 3.7.50. Conditional constraint
- 3.7.51. Configuration problem
- 3.7.52. Connected component
- 3.7.53. Consecutive loops are connected
- 3.7.54. Consecutive values
- 3.7.55. Constraint between two collections of variables
- 3.7.56. Constraint between three collections of variables
- 3.7.57. Constraint involving set variables
- 3.7.58. Constraint on the intersection
- 3.7.59. Constructive disjunction
- 3.7.60. Contact
- 3.7.61. Contractible
- 3.7.62. Convex
- 3.7.63. Convex bipartite graph
- 3.7.64. Convex hull relaxation
- 3.7.65. Conway packing problem
- 3.7.66. Core
- 3.7.67. Costas arrays
- 3.7.68. Cost filtering constraint
- 3.7.69. Cost matrix
- 3.7.70. Counting constraint
- 3.7.71. Cumulative longest hole problems
- 3.7.72. Cycle
- 3.7.73. Cyclic
- 3.7.74. Data constraint
- 3.7.75. Deadlock breaking
- 3.7.76. Decomposition
- 3.7.77. Decomposition-based violation measure
- 3.7.78. Demand profile
- 3.7.79. Degree of diversity of a set of solutions
- 3.7.80. Derived collection
- 3.7.81. DFS-bottleneck
- 3.7.82. Difference
- 3.7.83. Difference between pairs of variables
- 3.7.84. Directed acyclic graph
- 3.7.85. Disequality
- 3.7.86. Disjunction
- 3.7.87. Domain channel
- 3.7.88. Domain definition
- 3.7.89. Dominating queens
- 3.7.90. Domination
- 3.7.91. Dual model
- 3.7.92. Duplicated variables
- 3.7.93. Dynamic programming
- 3.7.94. Empty intersection
- 3.7.95. Entailment
- 3.7.96. Equality
- 3.7.97. Equality between multisets
- 3.7.98. Equivalence
- 3.7.99. Euler knight
- 3.7.100. Excluded
- 3.7.101. Extensible
- 3.7.102. Extension
- 3.7.103. Facilities location problem
- 3.7.104. Floor planning problem
- 3.7.105. Flow
- 3.7.106. Frequency allocation problem
- 3.7.107. Functional dependency
- 3.7.108. Geometrical constraint
- 3.7.109. Glue matrix
- 3.7.110. Golomb ruler
- 3.7.111. Graph colouring
- 3.7.112. Graph constraint
- 3.7.113. Graph partitioning constraint
- 3.7.114. Guillotine cut
- 3.7.115. Hall interval
- 3.7.116. Hamiltonian
- 3.7.117. Heuristics
- 3.7.118. Heuristics and Berge-acyclic constraint network
- 3.7.119. Heuristics and lexicographical ordering
- 3.7.120. Heuristics for two-dimensional rectangle placement problems
- 3.7.121. Hungarian method for the assignment problem
- 3.7.122. Hybrid-consistency
- 3.7.123. Hypergraph
- 3.7.124. Included
- 3.7.125. Inclusion
- 3.7.126. Incompatible pairs of values
- 3.7.127. Indistinguishable values
- 3.7.128. Interval
- 3.7.129. Involution
- 3.7.130. Joker value
- 3.7.131. Klee's measure problem
- 3.7.132. Labelling by increasing cost
- 3.7.133. Latin square
- 3.7.134. Lexicographic order
- 3.7.135. Limited discrepancy search
- 3.7.136. Linear programming
- 3.7.137. Line segments intersection
- 3.7.138. Logic
- 3.7.139. Logigraphe
- 3.7.140. Magic hexagon
- 3.7.141. Magic series
- 3.7.142. Magic square
- 3.7.143. Matching
- 3.7.144. Matrix
- 3.7.145. Matrix model
- 3.7.146. Matrix symmetry
- 3.7.147. Maximum
- 3.7.148. Maximum clique
- 3.7.149. Maximum number of occurrences
- 3.7.150. maxint
- 3.7.151. Metro
- 3.7.152. Minimum
- 3.7.153. Minimum cost flow
- 3.7.154. Minimum feedback vertex set
- 3.7.155. Minimum hitting set cardinality
- 3.7.156. Minimum number of occurrences
- 3.7.157. Modulo
- 3.7.158. Multi-site employee scheduling with calendar constraints
- 3.7.159. Multiset
- 3.7.160. Multiset ordering
- 3.7.161. No cycle
- 3.7.162. No loop
- 3.7.163. n-Amazons
- 3.7.164. n-queens
- 3.7.165. Non-deterministic automaton
- 3.7.166. Non-overlapping
- 3.7.167. Number of changes
- 3.7.168. Number of distinct equivalence classes
- 3.7.169. Number of distinct values
- 3.7.170. Obscure
- 3.7.171. One succ
- 3.7.172. Open automaton constraint
- 3.7.173. Open constraint
- 3.7.174. Order constraint
- 3.7.175. Orthotope
- 3.7.176. Overlapping alldifferent
- 3.7.177. Pair
- 3.7.178. Packing almost squares
- 3.7.179. Pallet loading
- 3.7.180. Partition
- 3.7.181. Path
- 3.7.182. Partridge
- 3.7.183. Pattern sequencing
- 3.7.184. Pentomino
- 3.7.185. Periodic
- 3.7.186. Permutation
- 3.7.187. Permutation channel
- 3.7.188. Phi-tree
- 3.7.189. Phylogeny
- 3.7.190. Pick-up delivery
- 3.7.191. Planarity test
- 3.7.192. Polygon
- 3.7.193. Positioning constraint
- 3.7.194. Predefined constraint
- 3.7.195. Preferences
- 3.7.196. Producer-consumer
- 3.7.197. Product
- 3.7.198. Program verification
- 3.7.199. Proximity constraint
- 3.7.200. Pure functional dependency
- 3.7.201. Quadtree
- 3.7.202. Range
- 3.7.203. Rank
- 3.7.204. RCC8
- 3.7.205. Rectangle clique partition
- 3.7.206. Regret based heuristics
- 3.7.207. Regret based heuristics in matrix problems
- 3.7.208. Reified automaton constraint
- 3.7.209. Reified constraint
- 3.7.210. Relation
- 3.7.211. Relaxation
- 3.7.212. Relaxation dimension
- 3.7.213. Resource constraint
- 3.7.214. Reverse of a constraint
- 3.7.215. Run of a permutation
- 3.7.216. SAT
- 3.7.217. Scalar product
- 3.7.218. Sequence
- 3.7.219. Sequence dependent set-up
- 3.7.220. Sequencing with release times and deadlines
- 3.7.221. Set channel
- 3.7.222. Set packing
- 3.7.223. Shikaku
- 3.7.224. Scheduling constraint
- 3.7.225. Scheduling with machine choice, calendars and preemption
- 3.7.226. Shared table
- 3.7.227. Schur number
- 3.7.228. SLAM problem
- 3.7.229. Sliding cyclic(1) constraint network(1)
- 3.7.230. Sliding cyclic(1) constraint network(2)
- 3.7.231. Sliding cyclic(1) constraint network(3)
- 3.7.232. Sliding cyclic(2) constraint network(2)
- 3.7.233. Sliding sequence constraint
- 3.7.234. Smallest square for packing consecutive dominoes
- 3.7.235. Smallest rectangle area
- 3.7.236. Smallest square for packing rectangles with distinct sizes
- 3.7.237. Soft constraint
- 3.7.238. Sort
- 3.7.239. Sort based reformulation
- 3.7.240. Sparse functional dependency
- 3.7.241. Sparse table
- 3.7.242. Sport timetabling
- 3.7.243. Squared squares
- 3.7.244. Statistics
- 3.7.245. Strip packing
- 3.7.246. Strong articulation point
- 3.7.247. Strong bridge
- 3.7.248. Strongly connected component
- 3.7.249. Subset sum
- 3.7.250. Sudoku
- 3.7.251. Sum
- 3.7.252. Sweep
- 3.7.253. Symmetric
- 3.7.254. Symmetry
- 3.7.255. System of constraints
- 3.7.256. Table
- 3.7.257. Temporal constraint
- 3.7.258. Ternary constraint
- 3.7.259. Timetabling constraint
- 3.7.260. Time window
- 3.7.261. Touch
- 3.7.262. Tree
- 3.7.263. Tuple
- 3.7.264. Two-dimensional orthogonal packing
- 3.7.265. Unary constraint
- 3.7.266. Undirected graph
- 3.7.267. Value constraint
- 3.7.268. Value partitioning constraint
- 3.7.269. Value precedence
- 3.7.270. Variable-based violation measure
- 3.7.271. Variable indexing
- 3.7.272. Variable subscript
- 3.7.273. Vector
- 3.7.274. Vpartition
- 3.7.275. Weighted assignment
- 3.7.276. Workload covering
- 3.7.277. Zebra puzzle
- 3.7.278. 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. Functional dependency invariants
- 4.5. The electronic version of the catalogue
- 4.5.1. Prolog facts describing a constraint
- 4.5.2. XML schema associated with a global constraint
- 4.5.2.1. Related work
- 4.5.2.2. Key features
- 4.5.2.3. Structure of schema
- 4.5.2.4. Generating schema from the catalogue
- 4.5.2.5. Conclusion
- 5. Global Constraint Catalogue
- 5.1. abs_value
- 5.2. all_differ_from_at_least_k_pos
- 5.3. all_differ_from_at_most_k_pos
- 5.4. all_differ_from_exactly_k_pos
- 5.5. all_equal
- 5.6. all_equal_peak
- 5.7. all_equal_peak_max
- 5.8. all_equal_valley
- 5.9. all_equal_valley_min
- 5.10. all_incomparable
- 5.11. all_min_dist
- 5.12. alldifferent
- 5.13. alldifferent_between_sets
- 5.14. alldifferent_consecutive_values
- 5.15. alldifferent_cst
- 5.16. alldifferent_except_0
- 5.17. alldifferent_interval
- 5.18. alldifferent_modulo
- 5.19. alldifferent_on_intersection
- 5.20. alldifferent_partition
- 5.21. alldifferent_same_value
- 5.22. allperm
- 5.23. among
- 5.24. among_diff_0
- 5.25. among_interval
- 5.26. among_low_up
- 5.27. among_modulo
- 5.28. among_seq
- 5.29. among_var
- 5.30. and
- 5.31. arith
- 5.32. arith_or
- 5.33. arith_sliding
- 5.34. assign_and_counts
- 5.35. assign_and_nvalues
- 5.36. atleast
- 5.37. atleast_nvalue
- 5.38. atleast_nvector
- 5.39. atmost
- 5.40. atmost1
- 5.41. atmost_nvalue
- 5.42. atmost_nvector
- 5.43. balance
- 5.44. balance_cycle
- 5.45. balance_interval
- 5.46. balance_modulo
- 5.47. balance_partition
- 5.48. balance_path
- 5.49. balance_tree
- 5.50. between_min_max
- 5.51. big_peak
- 5.52. big_valley
- 5.53. bin_packing
- 5.54. bin_packing_capa
- 5.55. binary_tree
- 5.56. bipartite
- 5.57. calendar
- 5.58. cardinality_atleast
- 5.59. cardinality_atmost
- 5.60. cardinality_atmost_partition
- 5.61. change
- 5.62. change_continuity
- 5.63. change_pair
- 5.64. change_partition
- 5.65. change_vectors
- 5.66. circuit
- 5.67. circuit_cluster
- 5.68. circular_change
- 5.69. clause_and
- 5.70. clause_or
- 5.71. clique
- 5.72. colored_matrix
- 5.73. coloured_cumulative
- 5.74. coloured_cumulatives
- 5.75. common
- 5.76. common_interval
- 5.77. common_modulo
- 5.78. common_partition
- 5.79. compare_and_count
- 5.80. cond_lex_cost
- 5.81. cond_lex_greater
- 5.82. cond_lex_greatereq
- 5.83. cond_lex_less
- 5.84. cond_lex_lesseq
- 5.85. connect_points
- 5.86. connected
- 5.87. consecutive_groups_of_ones
- 5.88. consecutive_values
- 5.89. contains_sboxes
- 5.90. correspondence
- 5.91. count
- 5.92. counts
- 5.93. coveredby_sboxes
- 5.94. covers_sboxes
- 5.95. crossing
- 5.96. cumulative
- 5.97. cumulative_convex
- 5.98. cumulative_product
- 5.99. cumulative_two_d
- 5.100. cumulative_with_level_of_priority
- 5.101. cumulatives
- 5.102. cutset
- 5.103. cycle
- 5.104. cycle_card_on_path
- 5.105. cycle_or_accessibility
- 5.106. cycle_resource
- 5.107. cyclic_change
- 5.108. cyclic_change_joker
- 5.109. dag
- 5.110. decreasing
- 5.111. decreasing_peak
- 5.112. decreasing_valley
- 5.113. deepest_valley
- 5.114. derangement
- 5.115. differ_from_at_least_k_pos
- 5.116. differ_from_at_most_k_pos
- 5.117. differ_from_exactly_k_pos
- 5.118. diffn
- 5.119. diffn_column
- 5.120. diffn_include
- 5.121. discrepancy
- 5.122. disj
- 5.123. disjoint
- 5.124. disjoint_sboxes
- 5.125. disjoint_tasks
- 5.126. disjunctive
- 5.127. disjunctive_or_same_end
- 5.128. disjunctive_or_same_start
- 5.129. distance
- 5.130. distance_between
- 5.131. distance_change
- 5.132. divisible
- 5.133. divisible_or
- 5.134. dom_reachability
- 5.135. domain
- 5.136. domain_constraint
- 5.137. elem
- 5.138. elem_from_to
- 5.139. element
- 5.140. element_greatereq
- 5.141. element_lesseq
- 5.142. element_matrix
- 5.143. element_product
- 5.144. element_sparse
- 5.145. elementn
- 5.146. elements
- 5.147. elements_alldifferent
- 5.148. elements_sparse
- 5.149. eq
- 5.150. eq_cst
- 5.151. eq_set
- 5.152. equal_sboxes
- 5.153. equilibrium
- 5.154. equivalent
- 5.155. exactly
- 5.156. first_value_diff_0
- 5.157. full_group
- 5.158. gcd
- 5.159. geost
- 5.160. geost_time
- 5.161. geq
- 5.162. geq_cst
- 5.163. global_cardinality
- 5.164. global_cardinality_low_up
- 5.165. global_cardinality_low_up_no_loop
- 5.166. global_cardinality_no_loop
- 5.167. global_cardinality_with_costs
- 5.168. global_contiguity
- 5.169. golomb
- 5.170. graph_crossing
- 5.171. graph_isomorphism
- 5.172. group
- 5.173. group_skip_isolated_item
- 5.174. gt
- 5.175. highest_peak
- 5.176. imply
- 5.177. in
- 5.178. in_interval
- 5.179. in_interval_reified
- 5.180. in_intervals
- 5.181. in_relation
- 5.182. in_same_partition
- 5.183. in_set
- 5.184. incomparable
- 5.185. increasing
- 5.186. increasing_global_cardinality
- 5.187. increasing_nvalue
- 5.188. increasing_nvalue_chain
- 5.189. increasing_peak
- 5.190. increasing_sum
- 5.191. increasing_valley
- 5.192. indexed_sum
- 5.193. inflexion
- 5.194. inside_sboxes
- 5.195. int_value_precede
- 5.196. int_value_precede_chain
- 5.197. interval_and_count
- 5.198. interval_and_sum
- 5.199. inverse
- 5.200. inverse_offset
- 5.201. inverse_set
- 5.202. inverse_within_range
- 5.203. ith_pos_different_from_0
- 5.204. k_alldifferent
- 5.205. k_cut
- 5.206. k_disjoint
- 5.207. k_same
- 5.208. k_same_interval
- 5.209. k_same_modulo
- 5.210. k_same_partition
- 5.211. k_used_by
- 5.212. k_used_by_interval
- 5.213. k_used_by_modulo
- 5.214. k_used_by_partition
- 5.215. length_first_sequence
- 5.216. length_last_sequence
- 5.217. leq
- 5.218. leq_cst
- 5.219. lex2
- 5.220. lex_alldifferent
- 5.221. lex_alldifferent_except_0
- 5.222. lex_between
- 5.223. lex_chain_greater
- 5.224. lex_chain_greatereq
- 5.225. lex_chain_less
- 5.226. lex_chain_lesseq
- 5.227. lex_different
- 5.228. lex_equal
- 5.229. lex_greater
- 5.230. lex_greatereq
- 5.231. lex_less
- 5.232. lex_lesseq
- 5.233. lex_lesseq_allperm
- 5.234. link_set_to_booleans
- 5.235. longest_change
- 5.236. longest_decreasing_sequence
- 5.237. longest_increasing_sequence
- 5.238. lt
- 5.239. map
- 5.240. max_decreasing_slope
- 5.241. max_increasing_slope
- 5.242. max_index
- 5.243. max_n
- 5.244. max_nvalue
- 5.245. max_occ_of_consecutive_tuples_of_values
- 5.246. max_occ_of_sorted_tuples_of_values
- 5.247. max_occ_of_tuples_of_values
- 5.248. max_size_set_of_consecutive_var
- 5.249. maximum
- 5.250. maximum_modulo
- 5.251. meet_sboxes
- 5.252. min_decreasing_slope
- 5.253. min_dist_between_inflexion
- 5.254. min_increasing_slope
- 5.255. min_index
- 5.256. min_n
- 5.257. min_nvalue
- 5.258. min_size_full_zero_stretch
- 5.259. min_size_set_of_consecutive_var
- 5.260. min_width_peak
- 5.261. min_width_valley
- 5.262. minimum
- 5.263. minimum_except_0
- 5.264. minimum_greater_than
- 5.265. minimum_modulo
- 5.266. minimum_weight_alldifferent
- 5.267. multi_global_contiguity
- 5.268. multi_inter_distance
- 5.269. multiple
- 5.270. nand
- 5.271. nclass
- 5.272. neq
- 5.273. neq_cst
- 5.274. nequivalence
- 5.275. next_element
- 5.276. next_greater_element
- 5.277. ninterval
- 5.278. no_peak
- 5.279. no_valley
- 5.280. non_overlap_sboxes
- 5.281. nor
- 5.282. not_all_equal
- 5.283. not_in
- 5.284. npair
- 5.285. nset_of_consecutive_values
- 5.286. nvalue
- 5.287. nvalue_on_intersection
- 5.288. nvalues
- 5.289. nvalues_except_0
- 5.290. nvector
- 5.291. nvectors
- 5.292. nvisible_from_end
- 5.293. nvisible_from_start
- 5.294. open_alldifferent
- 5.295. open_among
- 5.296. open_atleast
- 5.297. open_atmost
- 5.298. open_global_cardinality
- 5.299. open_global_cardinality_low_up
- 5.300. open_maximum
- 5.301. open_minimum
- 5.302. opposite_sign
- 5.303. or
- 5.304. orchard
- 5.305. order
- 5.306. ordered_atleast_nvector
- 5.307. ordered_atmost_nvector
- 5.308. ordered_global_cardinality
- 5.309. ordered_nvector
- 5.310. orth_link_ori_siz_end
- 5.311. orth_on_the_ground
- 5.312. orth_on_top_of_orth
- 5.313. orths_are_connected
- 5.314. overlap_sboxes
- 5.315. path
- 5.316. path_from_to
- 5.317. pattern
- 5.318. peak
- 5.319. period
- 5.320. period_except_0
- 5.321. period_vectors
- 5.322. permutation
- 5.323. place_in_pyramid
- 5.324. polyomino
- 5.325. power
- 5.326. precedence
- 5.327. product_ctr
- 5.328. proper_circuit
- 5.329. proper_forest
- 5.330. range_ctr
- 5.331. relaxed_sliding_sum
- 5.332. remainder
- 5.333. roots
- 5.334. same
- 5.335. same_and_global_cardinality
- 5.336. same_and_global_cardinality_low_up
- 5.337. same_intersection
- 5.338. same_interval
- 5.339. same_modulo
- 5.340. same_partition
- 5.341. same_sign
- 5.342. scalar_product
- 5.343. sequence_folding
- 5.344. set_value_precede
- 5.345. shift
- 5.346. sign_of
- 5.347. size_max_seq_alldifferent
- 5.348. size_max_starting_seq_alldifferent
- 5.349. sliding_card_skip0
- 5.350. sliding_distribution
- 5.351. sliding_sum
- 5.352. sliding_time_window
- 5.353. sliding_time_window_from_start
- 5.354. sliding_time_window_sum
- 5.355. smooth
- 5.356. soft_all_equal_max_var
- 5.357. soft_all_equal_min_ctr
- 5.358. soft_all_equal_min_var
- 5.359. soft_alldifferent_ctr
- 5.360. soft_alldifferent_var
- 5.361. soft_cumulative
- 5.362. soft_same_interval_var
- 5.363. soft_same_modulo_var
- 5.364. soft_same_partition_var
- 5.365. soft_same_var
- 5.366. soft_used_by_interval_var
- 5.367. soft_used_by_modulo_var
- 5.368. soft_used_by_partition_var
- 5.369. soft_used_by_var
- 5.370. some_equal
- 5.371. sort
- 5.372. sort_permutation
- 5.373. stable_compatibility
- 5.374. stage_element
- 5.375. stretch_circuit
- 5.376. stretch_path
- 5.377. stretch_path_partition
- 5.378. strict_lex2
- 5.379. strictly_decreasing
- 5.380. strictly_increasing
- 5.381. strongly_connected
- 5.382. subgraph_isomorphism
- 5.383. sum
- 5.384. sum_ctr
- 5.385. sum_cubes_ctr
- 5.386. sum_free
- 5.387. sum_of_increments
- 5.388. sum_of_weights_of_distinct_values
- 5.389. sum_powers4_ctr
- 5.390. sum_powers5_ctr
- 5.391. sum_powers6_ctr
- 5.392. sum_set
- 5.393. sum_squares_ctr
- 5.394. symmetric
- 5.395. symmetric_alldifferent
- 5.396. symmetric_alldifferent_except_0
- 5.397. symmetric_alldifferent_loop
- 5.398. symmetric_cardinality
- 5.399. symmetric_gcc
- 5.400. temporal_path
- 5.401. tour
- 5.402. track
- 5.403. tree
- 5.404. tree_range
- 5.405. tree_resource
- 5.406. twin
- 5.407. two_layer_edge_crossing
- 5.408. two_orth_are_in_contact
- 5.409. two_orth_column
- 5.410. two_orth_do_not_overlap
- 5.411. two_orth_include
- 5.412. used_by
- 5.413. used_by_interval
- 5.414. used_by_modulo
- 5.415. used_by_partition
- 5.416. uses
- 5.417. valley
- 5.418. vec_eq_tuple
- 5.419. visible
- 5.420. weighted_partial_alldiff
- 5.421. xor
- 5.422. zero_or_not_zero
- 5.423. zero_or_not_zero_vectors
- 6. Legend for the Description
- 6.1. Restrictions
- 6.2. Arc generators
- 6.3. Graph parameters
- 6.4. Set generators