A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem (Q3768396): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/828.322450 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150121468 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem |
scientific article |
Statements
A Polynomial Linear Search Algorithm for the <i>n</i> -Dimensional Knapsack Problem (English)
0 references
1984
0 references
NP-completeness
0 references
linear search algorithm
0 references
n-dimensional knapsack problem
0 references
