About: Multiple subset sum

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Multiple subset sum Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMultiple_subset_sum

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 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:

Attributes	Values
rdfs:label	Multiple subset sum (en)
rdfs:comment	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 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: (en)
dcterms:subject	Optimization algorithms and methods
Wikipage page ID	67841457 (xsd:integer)
Wikipage revision ID	1027271928 (xsd:integer)
Link from a Wikipage to another Wikipage	Proportional-fair rule Max-min item allocation Price of fairness Multiset Computer science Partition problem Optimization algorithms and methods 3-partition problem Fair item allocation Egalitarian rule Polynomial-time approximation scheme Operations research Optimization problem Knapsack problem Subset sum problem Lenstra's algorithm Multiple knapsack problem Strongly NP-hard
sameAs	Multiple subset sum Multiple subset sum
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Reflist
has abstract	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 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 possible, such that the sum in each subset j is at most Cj. * Max-min MSSP (also called bottleneck MSSP or BMSSP): again each subset has a capacity, but now the goal is to make the smallest subset sum as large as possible. * Fair SSP: the subsets have no fixed capacities, but each subset belongs to a different person. The utility of each person is the sum of items in his/her subsets. The goal is to construct subsets that satisfy a given criterion of fairness, such as max-min item allocation. (en)
prov:wasDerivedFrom	wikipedia-en:Multiple_subset_sum?oldid=1027271928&ns=0
page length (characters) of wiki page	10139 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Multiple_subset_sum
is Link from a Wikipage to another Wikipage of	Fully polynomial-time approximation scheme Fair subset sum Fair subset sum problem Subset sum problem Multiple subset sum problem
is Wikipage redirect of	Fair subset sum Fair subset sum problem Multiple subset sum problem
is foaf:primaryTopic of	wikipedia-en:Multiple_subset_sum

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software