1
0
This repository has been archived on 2025-03-06. You can view files and clone it, but cannot push or open issues or pull requests.
on-restart-benchmarks/share/minizinc/std/lex_chain_greatereq_orbitope.mzn
Jip J. Dekker fad1b07018 Squashed 'software/minizinc/' content from commit 4f10c8205
git-subtree-dir: software/minizinc
git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
2021-06-16 14:06:46 +10:00

20 lines
719 B
MiniZinc

include "lex_chain_lesseq_orbitope.mzn";
/** @group globals.lexicographic
Requires that the columns of binary matrix \a a are
lexicographically sorted, non-increasing.
Moreover, the second parameter has the following meaning:
0: no further constraints, 1: set-partitioning orbitope,
2: set-packing orbitope
*/
predicate lex_chain_greatereq_orbitope(
array[int, int] of var int: a, int: kind) =
if 1>=card(index_set_2of2(a)) then true
else lex_chain_lesseq_orbitope(
array2d( index_set_1of2(a), index_set_2of2(a),
[a[i, max(index_set_2of2(a)) - j + min(index_set_2of2(a))] |
i in index_set_1of2(a), j in index_set_2of2(a)]
),
kind) endif;