An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3835301 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quadratic knapsack problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank | |||
Normal rank | |||
Revision as of 16:17, 7 June 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
