eldorado.tu-dortmund.de/server/api/core/bitstreams/51517cae-a13e-4e61-a81f-9ef6ede6e432/content
individual needs.
7
j 1 2 3 4 5 6 7 8 9
c1(p j) 3 3 6 2 1 0 0 4 5
d1,1(p j) 3 3 6 2 1 0 0 4 5
d1,2(p j) ∞ ∞ 9 5 4 2 1 4 5
d1,3(p j) ∞ ∞ ∞ ∞ 10 5 4 6 6
d1,4(p j) ∞ ∞ ∞ ∞ ∞ ∞ 10 9 9
c2(p j) 2 1 0 2 3 7 4 1 2
d2,1(p [...] j with j ∈ {1,4,6,8}, j ∈ {2,4,6,8}, j ∈ {1,5,7,9} or j ∈ {2,5,7,9}. Out of these possible selections, the pieces ending at positions p j, j ∈ {2,5,7,9}, optimize the costs of the second parameter and [...] to zero, causing the algorithm to accidently stop. Thus, a minimal increment is implemented in line 9.
3
Algorithm 1 Naïve Count Maximization Require: r1(·), . . . ,rI(·), α1, . . . ,αI , P, l, I 1: Define …