Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793)
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 6996808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems |
scientific article; zbMATH DE number 6996808 |
Statements
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (English)
0 references
27 December 2018
0 references
combinatorial quadratic optimization problems
0 references
binary and complementarity condition
0 references
completely positive relaxations
0 references
doubly nonnegative relaxations
0 references
semidefinite relaxations
0 references
equivalence of feasible regions
0 references
nondegeneracy
0 references
0 references
0 references
0 references
0 references
0 references
0.8140059113502502
0 references
0.811732828617096
0 references
0.7973044514656067
0 references
0.7938455939292908
0 references
