An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00244-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024911991 / rank | |||
Normal rank | |||
Latest revision as of 08:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem |
scientific article |
Statements
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (English)
0 references
12 January 2005
0 references
0--1 quadratic programming
0 references
Knapsack
0 references
Lagrangian decomposition
0 references
Branch-and-bound
0 references
Computational results
0 references
