Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints |
scientific article; zbMATH DE number 7198367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints |
scientific article; zbMATH DE number 7198367 |
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
0 references
0 references
0 references
0 references
0.8865361
0 references
0.8800854
0 references
0.87978053
0 references
0.87915874
0 references
0.87915874
0 references
0.87834305
0 references
0.8745011
0 references
0.87404597
0 references
0.8737043
0 references
