Multiple subset sum
id:
multiple-subset-sum-222-4167370
title:
Multiple subset sum
text:
The multiple subset sum problem is an optimization problem in computer science and operations research. It is a generalization of the subset sum problem. The input to the problem is a multiset S of n integers and a positive integer m representing the number of subsets. The goal is to construct, from the input integers, some m subsets. The problem has several variants:
- Max-sum MSSP: for each subset j in 1,...,m, there is a capacity Cj. The goal is to make the sum of all subsets as large as po
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Multiple_subset_sum
date created:
2021-06-03T13:41:27Z
date modified:
2024-09-14T10:21:54Z
main entity:
{"identifier":"Q107284558","url":"https://www.wikidata.org/entity/Q107284558"}
image:
fields total:
13
integrity:
14