|
Class Summary |
| Binary |
For the case "at most one", we can use the binary encoding (also called
birwise encoding) first described in A. |
| Binomial |
For the "at most one" case, this encoding is equivalent to the one referred
to in the literature as the pair-wise or naive encoding. |
| Commander |
The case "at most one" is introduced in W. |
| EncodingStrategyAdapter |
The aim of this class is to use different encodings for specific constraints. |
| Ladder |
For the cases "at most one" and "exactly one", we can use the ladder encoding
described in: I. |
| Policy |
This class allows the use of different encodings for different cardinality
constraints. |
| Product |
The encoding for "at most one" constraints was introduced by J. |
| Sequential |
For the cases "at most k", we can use the sequential encoding described in:
C. |