Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5789798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming |
scientific article; zbMATH DE number 5789798 |
Statements
Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (English)
0 references
21 September 2010
0 references
indefinite integer quadratic programming
0 references
lower bounds
0 references
convex relaxation
0 references
Lagrangian decomposition
0 references
branch-and-bound method
0 references
0 references
0 references
0 references
0 references
0.8548225164413452
0 references
0.8318255543708801
0 references
0.8083846569061279
0 references
0.7757638692855835
0 references
