Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem |
scientific article |
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
