|
|
|
Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli
Dipartimento di Informatica e Sistemistica
Università di Roma "La Sapienza"
via Salaria 113, I-00198 Roma, Italy
Appeared in
Constraints, 13(4), pages 407-436, 2008.
Web appendix
[CSPLib #] Go to the CSPLib page for this problem This is a generalization of the specification given in the CSPLib (which fixes the forthcoming value 'n' to 4). Given two sets of the numbers from 1 to n, the problem amounts
to arrange the 2n numbers in the two sets into a single sequence in which the two 1's appear one number apart, the two 2's appear two numbers apart, the two 3's appear three numbers apart,... , and the two n's appear n numbers apart.
- n, the size of each set of numbers
The set of all possible assignments of integers from 1 to n
to the 2n positions of the sequence- C1: Each number occurs twice in the sequence
- C2: The two occurrences of each number z must appear z positions apart in the sequence
Problem specifications
| Specification | OPL | DLV | LPARSE |
|---|
| BASE: Base specification |
|
|
|
| SBSO: Symmetry-breaking by selective ordering |
|
|
|
| AUX: Addition of auxiliary predicates |
|
|
|
| GCDT: Exploitation of distribute() global constraint |
| -- | -- |
| AUX-SBSO: Addition of auxiliary predicates plus Symmetry-breaking by selective ordering |
|
|
|
| AUX-GCAD: Addition of auxiliary predicates plus Exploitation of alldifferent() global constraint |
| -- | -- |
| AUX-GCAD-GCDT: Addition of auxiliary predicates plus Exploitation of alldifferent() global constraint plus Exploitation of distribute() global constraint |
| -- | -- |
| AUX-GCAD-GCDT-SBSO: Addition of auxiliary predicates plus Exploitation of alldifferent() global constraint plus Exploitation of distribute() global constraint plus Symmetry-breaking by selective ordering |
| -- | -- |
Return to the problem list
|
[This web site could never be realised without the sophisticated features of a pure text editor and the extreme power of 220V]
|
Home page