An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(77)90024-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056380589 / rank | |||
Normal rank | |||
Revision as of 02:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the zero-one knapsack problem and a branch and bound algorithm |
scientific article |
Statements
An upper bound for the zero-one knapsack problem and a branch and bound algorithm (English)
0 references
1977
0 references
