Specialized constraints on integer decision variables

Specialized constraints on integer decision variables are designed and implemented to reduce domains of variables efficiently during a search.

Overview
Specialized constraints on integer decision variables are designed and implemented to reduce domains of variables efficiently during a search.
All different constraint
The all different constraint is a specialized constraint which forces every decision variable in a given group to assume a value different from the value of every other decision variable in that group.
Minimum distance constraint
The minimum distance constraint is a specialized constraint which forces every decision variable in a given group to assume values which differ by at least the specified amount.
Packing constraint
The packing constraint is a specialized constraint which maintains the load of a group of containers or bins, given a group of weighted items and an assignment of items to containers.
Inverse constraint
The inverse constraint is a specialized constraint which forces two groups of decision variables to be in strict correspondence with each other.
Lexicographic constraint
The lexicographic constraint is a specialized constraint which maintains order between two groups of expressions.
Distribution constraint
The distribution constraint is a specialized constraint which counts the number of occurrences of several values among the decision variables in an array of decision variables.

Parent topic: Constraints and expressions in CP Optimizer