A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (Q5436249): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11741-007-0308-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11741-007-0308-Z / rank | |||
Normal rank | |||
Latest revision as of 17:00, 30 December 2024
scientific article; zbMATH DE number 5226829
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems |
scientific article; zbMATH DE number 5226829 |
Statements
A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems (English)
0 references
14 January 2008
0 references
multi-dimensional quadratic \(0\)-\(1\) knapsack problem
0 references
branch-and-bound method
0 references
Lagrangian relaxation
0 references
