A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6033977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem |
scientific article; zbMATH DE number 6033977 |
Statements
13 May 2012
0 references
0-1 knapsack problems
0 references
Lagrangian relaxation
0 references
branch and bound
0 references
0.9128243
0 references
0.9117839
0 references
0.91155624
0 references
0 references
0.9054519
0 references
0.8931706
0 references
0.88967687
0 references
0.8890437
0 references
0.8844194
0 references
A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (English)
0 references
