Balanced number partitioning
id:
balanced-number-partitioning-258-5735461
title:
Balanced number partitioning
text:
Balanced number partitioning is a variant of multiway number partitioning in which there are constraints on the number of items allocated to each set. The input to the problem is a set of n items of different sizes, and two integers m, k. The output is a partition of the items into m subsets, such that the number of items in each subset is at most k. Subject to this, it is required that the sums of sizes in the m subsets are as similar as possible. An example application is identical-machines sc
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Balanced_number_partitioning
date created:
date modified:
2023-11-29T09:33:16Z
main entity:
{"identifier":"Q109297379","url":"https://www.wikidata.org/entity/Q109297379"}
image:
fields total:
13
integrity:
13