Babel, Luitpold; Kellerer, Hans; Kotov, Vladimir - In: Computational Statistics 47 (1998) 1, pp. 59-82
Thek-partitioning problem is defined as follows: Given a set of items {I 1 ,I 2 ,...,I n } where itemIj is of weightwj ≥ 0, find a partitionS 1 ,S 2 ,...,S m of this set with ¦S i ¦ =k such that the maximum weight of all subsetsS i is minimal,k-partitioning is strongly related to the...
