A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:31, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem |
scientific article |
Statements
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (English)
0 references
13 May 2012
0 references
0-1 knapsack problems
0 references
Lagrangian relaxation
0 references
branch and bound
0 references
