Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463)
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 7289372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem |
scientific article; zbMATH DE number 7289372 |
Statements
Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (English)
0 references
29 December 2020
0 references
tree-shaped facility
0 references
variance criterion
0 references
mean absolute deviation criterion
0 references
conic linear programming
0 references
semidefinite programming relaxation
0 references
0 references
0 references
0 references
0.7766376733779907
0 references
0.7395084500312805
0 references
0.737962007522583
0 references
0.7250264883041382
0 references
0.7250264883041382
0 references
