Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables (Q2928409)
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: Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables |
scientific article; zbMATH DE number 6366703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables |
scientific article; zbMATH DE number 6366703 |
Statements
7 November 2014
0 references
nonconvex quadratic optimization
0 references
0-1 mixed integer program
0 references
Lagrangian relaxation
0 references
copositve programming relaxation
0 references
completely positive programming relaxation
0 references
Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables (English)
0 references
0.8094856142997742
0 references
0.8066391944885254
0 references
0.7909944653511047
0 references
0.78435218334198
0 references
0.7732982635498047
0 references
