Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 22:34, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints |
scientific article |
Statements
Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (English)
0 references
11 May 2020
0 references
generalized quadratic assignment problem
0 references
crossdock door assignment problem
0 references
quadratic knapsack problem
0 references
RLT bounds
0 references
Lagrangean relaxation
0 references
integer linearization property
0 references
