-
Notifications
You must be signed in to change notification settings - Fork 78
/
bin_packing_capa.mzn
32 lines (28 loc) · 1.12 KB
/
bin_packing_capa.mzn
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/** @group globals.packing
Requires that each item \p i with weight \a w[\p i], be put into \a bin[\p i] such
that the sum of the weights of the items in each bin \p b does not exceed the
capacity \a c[\p b].
Assumptions:
- forall \p i, \a w[\p i] >=0
- forall \p b, \a c[\p b] >=0
*/
predicate bin_packing_capa(array[int] of int: c,
array[int] of var int: bin,
array[int] of int: w) =
assert(index_set(bin) = index_set(w),
"bin_packing_capa: the bin and weight arrays must have identical index sets",
assert(lb_array(w) >= 0,
"bin_packing_capa: the weights must be non-negative",
assert(lb_array(c) >= 0,
"bin_packing_capa: the capacities must be non-negative",
forall( i in index_set(bin) ) (
min(index_set(c)) <= bin[i] /\ bin[i] <= max(index_set(c))
)
/\
forall( b in index_set(c) ) (
c[b] >= sum ( i in index_set(bin) ) (
w[i] * bool2int( bin[i] = b )
)
)
)));
%-----------------------------------------------------------------------------%