The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10958-009-9612-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10958-009-9612-Y / rank | |||
Normal rank | |||
Latest revision as of 05:00, 10 December 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
0 references
