Conic relaxation approaches for equal deployment problems (Q2297663)
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: Conic relaxation approaches for equal deployment problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conic relaxation approaches for equal deployment problems |
scientific article |
Statements
Conic relaxation approaches for equal deployment problems (English)
0 references
20 February 2020
0 references
semidefinite programming
0 references
second-order cone programming
0 references
mixed-integer conic programming
0 references
conic relaxation
0 references
tree breeding
0 references
equal deployment problem
0 references
0 references
0 references
0 references
0.8204973340034485
0 references
0.7054624557495117
0 references
0.6984748244285583
0 references
0.6795533895492554
0 references
0.6733793616294861
0 references
