An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:35, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n) algorithm for the multiple-choice knapsack linear program |
scientific article |
Statements
An O(n) algorithm for the multiple-choice knapsack linear program (English)
0 references
1984
0 references
linear algorithm
0 references
computational complexity
0 references
analysis of algorithms
0 references
multiple choice knapsack problem
0 references
