The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:20, 6 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The linking set problem: a polynomial special case of the multiple-choice knapsack problem |
scientific article |
Statements
The linking set problem: a polynomial special case of the multiple-choice knapsack problem (English)
0 references
19 January 2010
0 references
