A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5294045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non delayed relax-and-cut algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993418 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3678962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Where are the hard knapsack problems? / rank | |||
Normal rank |
Latest revision as of 05:25, 5 July 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