Computing minmax regret 1-median on a tree network with positive/negative vertex weights (Q4909575)
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: Computing minmax regret 1-median on a tree network with positive/negative vertex weights |
scientific article; zbMATH DE number 6147843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minmax regret 1-median on a tree network with positive/negative vertex weights |
scientific article; zbMATH DE number 6147843 |
Statements
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights (English)
0 references
21 March 2013
0 references
0.9382977485656738
0 references
0.9298948049545288
0 references
0.9107589721679688
0 references
0.9059796929359436
0 references
0.8961669206619263
0 references
