An Algorithm for Large Zero-One Knapsack Problems (Q3896840): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1287/opre.28.5.1130 / rank | |||
Property / author | |||
Property / author: Eitan Zemel / rank | |||
Property / author | |||
Property / author: Eitan Zemel / rank | |||
Normal rank | |||
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.1287/opre.28.5.1130 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017316844 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1287/OPRE.28.5.1130 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:33, 21 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Algorithm for Large Zero-One Knapsack Problems |
scientific article |
Statements
An Algorithm for Large Zero-One Knapsack Problems (English)
0 references
1980
0 references
large zero-one knapsack problems
0 references
algorithm
0 references
binary search-type procedure
0 references
simple heuristic
0 references
computational experience
0 references
randomly generated test problems
0 references
problem core
0 references
hard knapsack problems
0 references