Multiway number partitioning
id:
multiway-number-partitioning-291-10607271
title:
Multiway number partitioning
text:
In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums of the subsets are as similar as possible. It was first presented by Ronald Graham in 1969 in the context of the identical-machines scheduling problem. The problem is parametrized by a positive integer k, and called k-way number partitioning. The input to the problem is a multiset S of numbers, whose sum is k*T. The associated decision problem
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Multiway_number_partitioning
date created:
date modified:
2024-01-26T00:54:57Z
main entity:
{"identifier":"Q104871753","url":"https://www.wikidata.org/entity/Q104871753"}
image:
fields total:
13
integrity:
13