Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 15:39, 5 March 2024
scientific article; zbMATH DE number 1161018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems |
scientific article; zbMATH DE number 1161018 |
Statements
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (English)
0 references
10 August 1998
0 references
valid inequalities
0 references
optimal Lagrangian multipliers
0 references
branch-and-bound
0 references
