A better step-off algorithm for the knapsack problem (Q1137512): Difference between revisions
From MaRDI portal
Added link to MaRDI 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 / cites work | |||
| Property / cites work: The Theory and Computation of Knapsack Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Finite Renewal Algorithm for the Knapsack and Turnpike Models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for a linear Diophantine equation and a problem of Frobenius / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(80)90051-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005421729 / rank | |||
Normal rank | |||
Latest revision as of 09:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better step-off algorithm for the knapsack problem |
scientific article |
Statements
A better step-off algorithm for the knapsack problem (English)
0 references
1980
0 references
step-off algorithm
0 references
knapsack problem
0 references
