Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1287/opre.45.5.768 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2130350796 / rank | |||
Normal rank | |||
Latest revision as of 01:02, 20 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
