Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
41 lines
1.2 KiB
MiniZinc
41 lines
1.2 KiB
MiniZinc
include "lex_lesseq.mzn";
|
|
|
|
predicate fzn_lex_chain_lesseq_orbitope(
|
|
array[int, int] of var int: a, int: kind) =
|
|
if MZN__Orbitope then
|
|
fzn_lex_chain_lesseq__orbitope( a,
|
|
card(index_set_1of2(a)), kind, true,
|
|
not mzn_in_symmetry_breaking_constraint()
|
|
)
|
|
else
|
|
fzn_lex_chain_lesseq_orbitope__CP(a, kind)
|
|
endif;
|
|
|
|
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% SCIP 7.0.2, binary matrix, columns sorted
|
|
predicate fzn_lex_chain_lesseq__orbitope(array[int, int] of var int: matr,
|
|
int: m, int: orbType, bool: resolveprop, bool: isModelCons);
|
|
|
|
|
|
predicate fzn_lex_chain_lesseq_orbitope__CP(
|
|
array[int, int] of var int: a, int: kind) =
|
|
let {
|
|
int: lb2 = min(index_set_2of2(a)),
|
|
int: ub2 = max(index_set_2of2(a))
|
|
} in (
|
|
forall(j in lb2 + 1 .. ub2) (
|
|
lex_lesseq(col(a, j-1), col(a, j))
|
|
)
|
|
/\
|
|
if 1==kind then
|
|
forall(i in index_set_1of2(a))(
|
|
1 == sum(row(a, i))
|
|
)
|
|
elseif 2==kind then
|
|
forall(i in index_set_1of2(a))(
|
|
1 >= sum(row(a, i))
|
|
)
|
|
else true
|
|
endif
|
|
);
|