The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The linking set problem: a polynomial special case of the multiple-choice knapsack problem |
scientific article; zbMATH DE number 5660169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linking set problem: a polynomial special case of the multiple-choice knapsack problem |
scientific article; zbMATH DE number 5660169 |
Statements
The linking set problem: a polynomial special case of the multiple-choice knapsack problem (English)
0 references
19 January 2010
0 references
0 references
0.7658864855766296
0 references
0.7638314366340637
0 references
0.7495356798171997
0 references
