The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10958-009-9612-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092262142 / rank | |||
Normal rank | |||
Revision as of 23:39, 19 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
