Global Constraint Catalog

  • Home
  • Title
  • Preface
  • Bibliography
  • Index
  • Content

  • 1. Getting started
  • 2. Describing Global Constraints
  • 3. Description of the Catalogue
  • 4. Further Topics
  • 5. Global Constraint Catalogue
  • 6. Legend for the Description

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.3.1. How to see if a global constraint is in the catalogue?
    • 3.3.2. How to search for all global constraints sharing the same structure
      • 3.3.2.1. Searching from a graph property perspective
      • 3.3.2.2. Searching from an automaton perspective
    • 3.3.3. Searching all places where a global constraint is referenced
    • 3.3.4. Searching the correspondence with the constraint of a concrete system
  • 3.4. Figures of the catalogue
  • 3.5. Constraints arguments 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. Problems
    • 3.6.15. Puzzles
    • 3.6.16. 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. Assignment
    • 3.7.15. Assignment dimension
    • 3.7.16. At least
    • 3.7.17. At most
    • 3.7.18. Automaton
    • 3.7.19. Automaton with array of counters
    • 3.7.20. Automaton with counters
    • 3.7.21. Automaton without counters
    • 3.7.22. Balanced assignment
    • 3.7.23. Balanced tree
    • 3.7.24. Berge-acyclic constraint network
    • 3.7.25. Binary constraint
    • 3.7.26. Bioinformatics
    • 3.7.27. Bipartite
    • 3.7.28. Bipartite matching
    • 3.7.29. Bipartite matching in convex bipartite graphs
    • 3.7.30. Boolean channel
    • 3.7.31. Boolean constraint
    • 3.7.32. Border
    • 3.7.33. Bound-consistency
    • 3.7.34. Business rules
    • 3.7.35. Centered cyclic(1) constraint network(1)
    • 3.7.36. Centered cyclic(2) constraint network(1)
    • 3.7.37. Centered cyclic(3) constraint network(1)
    • 3.7.38. Channel routing
    • 3.7.39. Channelling constraint
    • 3.7.40. Circuit
    • 3.7.41. Circular sliding cyclic(1) constraint network(2)
    • 3.7.42. Cluster
    • 3.7.43. Coloured
    • 3.7.44. Compulsory part
    • 3.7.45. Conditional constraint
    • 3.7.46. Configuration problem
    • 3.7.47. Connected component
    • 3.7.48. Consecutive loops are connected
    • 3.7.49. Consecutive values
    • 3.7.50. Constraint between two collections of variables
    • 3.7.51. Constraint between three collections of variables
    • 3.7.52. Constraint involving set variables
    • 3.7.53. Constraint on the intersection
    • 3.7.54. Constructive disjunction
    • 3.7.55. Contact
    • 3.7.56. Convex
    • 3.7.57. Convex bipartite graph
    • 3.7.58. Convex hull relaxation
    • 3.7.59. Conway packing problem
    • 3.7.60. Core
    • 3.7.61. Costas arrays
    • 3.7.62. Cost filtering constraint
    • 3.7.63. Cost matrix
    • 3.7.64. Counting constraint
    • 3.7.65. Cumulative longest hole problems
    • 3.7.66. Cycle
    • 3.7.67. Cyclic
    • 3.7.68. Data constraint
    • 3.7.69. Deadlock breaking
    • 3.7.70. Decomposition
    • 3.7.71. Decomposition-based violation measure
    • 3.7.72. DFS-bottleneck
    • 3.7.73. Demand profile
    • 3.7.74. Degree of diversity of a set of solutions
    • 3.7.75. Derived collection
    • 3.7.76. Difference
    • 3.7.77. Difference between pairs of variables
    • 3.7.78. Directed acyclic graph
    • 3.7.79. Disequality
    • 3.7.80. Disjunction
    • 3.7.81. Domain channel
    • 3.7.82. Domain definition
    • 3.7.83. Dominating queens
    • 3.7.84. Domination
    • 3.7.85. Dual model
    • 3.7.86. Duplicated variables
    • 3.7.87. Dynamic programming
    • 3.7.88. Empty intersection
    • 3.7.89. Equality
    • 3.7.90. Equality between multisets
    • 3.7.91. Equivalence
    • 3.7.92. Euler knight
    • 3.7.93. Excluded
    • 3.7.94. Extension
    • 3.7.95. Facilities location problem
    • 3.7.96. Floor planning problem
    • 3.7.97. Flow
      • 3.7.97.1. Flow models for alldifferent, open_alldifferent
      • 3.7.97.2. Flow models for global_cardinality_low_up, global_cardinality_low_up_no_loop
      • 3.7.97.3. Flow models for used_by, same
      • 3.7.97.4. Flow model for same_and_global_cardinality_low_up
    • 3.7.98. Frequency allocation problem
    • 3.7.99. Functional dependency
    • 3.7.100. Geometrical constraint
    • 3.7.101. Golomb ruler
    • 3.7.102. Graph colouring
    • 3.7.103. Graph constraint
    • 3.7.104. Graph partitioning constraint
    • 3.7.105. Guillotine cut
    • 3.7.106. Hall interval
    • 3.7.107. Hamiltonian
    • 3.7.108. Heuristics
    • 3.7.109. Heuristics and lexicographical ordering
    • 3.7.110. Heuristics for two-dimensional rectangle placement problems
      • 3.7.110.1. Dual strategy for rectangle placement problems with no slack
      • 3.7.110.2. Strategy that gradually creates a compulsory part
    • 3.7.111. Hungarian method for the assignment problem
    • 3.7.112. Hybrid-consistency
    • 3.7.113. Hypergraph
    • 3.7.114. Included
    • 3.7.115. Inclusion
    • 3.7.116. Indistinguishable values
    • 3.7.117. Interval
    • 3.7.118. Joker value
    • 3.7.119. Klee's measure problem
    • 3.7.120. Latin square
    • 3.7.121. Lexicographic order
    • 3.7.122. Limited discrepancy search
    • 3.7.123. Linear programming
    • 3.7.124. Line-segments intersection
    • 3.7.125. Logic
    • 3.7.126. Magic hexagon
    • 3.7.127. Magic series
    • 3.7.128. Magic square
    • 3.7.129. Matching
    • 3.7.130. Matrix
    • 3.7.131. Matrix model
    • 3.7.132. Matrix symmetry
    • 3.7.133. Maximum
    • 3.7.134. Maximum clique
    • 3.7.135. Maximum number of occurrences
    • 3.7.136. maxint
    • 3.7.137. Minimum
    • 3.7.138. Minimum cost flow
    • 3.7.139. Minimum feedback vertex set
    • 3.7.140. Minimum hitting set cardinality
    • 3.7.141. Minimum number of occurrences
    • 3.7.142. Modulo
    • 3.7.143. Multiset
    • 3.7.144. Multiset ordering
    • 3.7.145. No cycle
    • 3.7.146. No loop
    • 3.7.147. n-queen
    • 3.7.148. Non-overlapping
    • 3.7.149. Number of changes
    • 3.7.150. Number of distinct equivalence classes
    • 3.7.151. Number of distinct values
    • 3.7.152. Obscure
    • 3.7.153. One succ
    • 3.7.154. Open automaton constraint
    • 3.7.155. Open constraint
    • 3.7.156. Order constraint
    • 3.7.157. Orthotope
    • 3.7.158. Overlapping alldifferent
    • 3.7.159. Pair
    • 3.7.160. Packing almost squares
    • 3.7.161. Pallet loading
    • 3.7.162. Partition
    • 3.7.163. Path
    • 3.7.164. Partridge
    • 3.7.165. Pattern sequencing
    • 3.7.166. Pentomino
    • 3.7.167. Periodic
    • 3.7.168. Permutation
    • 3.7.169. Permutation channel
    • 3.7.170. Phi-tree
    • 3.7.171. Phylogeny
    • 3.7.172. Pick-up delivery
    • 3.7.173. Planarity test
    • 3.7.174. Polygon
    • 3.7.175. Positioning constraint
    • 3.7.176. Predefined constraint
    • 3.7.177. Preferences
    • 3.7.178. Producer-consumer
    • 3.7.179. Product
    • 3.7.180. Program verification
    • 3.7.181. Proximity constraint
    • 3.7.182. Quadtree
    • 3.7.183. Range
    • 3.7.184. Rank
    • 3.7.185. RCC8
    • 3.7.186. Relation
    • 3.7.187. Rectangle clique partition
    • 3.7.188. Relaxation
    • 3.7.189. Resource constraint
    • 3.7.190. Run of a permutation
    • 3.7.191. SAT
    • 3.7.192. Scalar product
    • 3.7.193. Sequence
    • 3.7.194. Sequencing with release times and deadlines
    • 3.7.195. Set channel
    • 3.7.196. Set packing
    • 3.7.197. Shikaku
    • 3.7.198. Scheduling constraint
    • 3.7.199. Shared table
    • 3.7.200. Schur number
    • 3.7.201. SLAM problem
    • 3.7.202. Sliding cyclic(1) constraint network(1)
    • 3.7.203. Sliding cyclic(1) constraint network(2)
    • 3.7.204. Sliding cyclic(1) constraint network(3)
    • 3.7.205. Sliding cyclic(2) constraint network(2)
    • 3.7.206. Sliding sequence constraint
    • 3.7.207. Smallest square for packing consecutive dominoes
    • 3.7.208. Smallest rectangle area
    • 3.7.209. Smallest Square for Packing Rectangles with Distinct Sizes
    • 3.7.210. Soft constraint
    • 3.7.211. Sort
    • 3.7.212. Sparse functional dependency
    • 3.7.213. Sparse table
    • 3.7.214. Sport timetabling
    • 3.7.215. Squared squares
    • 3.7.216. Statistics
    • 3.7.217. Strip packing
    • 3.7.218. Strong articulation point
    • 3.7.219. Strongly connected component
    • 3.7.220. Subset sum
    • 3.7.221. Sudoku
    • 3.7.222. Sum
    • 3.7.223. Sweep
    • 3.7.224. Symmetry
    • 3.7.225. Symmetric
    • 3.7.226. System of constraints
    • 3.7.227. Table
    • 3.7.228. Temporal constraint
    • 3.7.229. Ternary constraint
    • 3.7.230. Timetabling constraint
    • 3.7.231. Time window
    • 3.7.232. Touch
    • 3.7.233. Tree
    • 3.7.234. Tuple
    • 3.7.235. Two dimensional orthogonal packing
    • 3.7.236. Unary constraint
    • 3.7.237. Undirected graph
    • 3.7.238. Value constraint
    • 3.7.239. Value partitioning constraint
    • 3.7.240. Value precedence
    • 3.7.241. Variable-based violation measure
    • 3.7.242. Variable indexing
    • 3.7.243. Variable subscript
    • 3.7.244. Vector
    • 3.7.245. Vpartition
    • 3.7.246. Weighted assignment
    • 3.7.247. Workload covering
    • 3.7.248. Zebra puzzle
< 3.7.155. Open constraint|3.7.157. Orthotope >

3.7.156. Order constraint

  • allperm,

  • cond_lex_cost,

  • cond_lex_greater,

  • cond_lex_greatereq,

  • cond_lex_less,

  • cond_lex_lesseq,

  • decreasing,

  • increasing,

  • increasing_global_cardinality,

  • increasing_nvalue,

  • increasing_nvalue_chain,

  • int_value_precede,

  • int_value_precede_chain,

  • lex2,

  • lex_between,

  • lex_chain_less,

  • lex_chain_lesseq,

  • lex_greater,

  • lex_greatereq,

  • lex_less,

  • lex_lesseq,

  • lex_lesseq_allperm,

  • max_index,

  • max_n,

  • maximum,

  • maximum_modulo,

  • min_index,

  • min_n,

  • minimum,

  • minimum_except_0,

  • minimum_greater_than,

  • minimum_modulo,

  • next_greater_element,

  • open_maximum,

  • open_minimum,

  • ordered_atleast_nvector,

  • ordered_atmost_nvector,

  • ordered_global_cardinality,

  • ordered_nvector,

  • set_value_precede,

  • strict_lex2,

  • strictly_decreasing,

  • strictly_increasing.

A constraint involving an ordering relation in its definition. An ordering relation R on a set S is a relation such that, for every a,​b,​c∈S:

  • a R b or b R a,

  • If a R b and b R c, then a R c,

  • If a R b and b R a then a=b.

last update: 2009-12-16. SD.