Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-018-0676-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2809623894 / rank | |||
Normal rank | |||
Revision as of 14:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems |
scientific article |
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
