O PROBLEMA DESPRE CENTRUL PROBABILIST AL ARBORELUI
In this paper we consider the weighted minimax (1-center) location problem on the tree with uniform distributed weights. The set of the T-centres and one algorithm of a Önding of the center of a tree with constant wieghteds is described.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moldova State University
2008-01-01
|
| Series: | Studia Universitatis Moldaviae: Stiinte Umanistice |
| Online Access: | https://ojs.studiamsu.md/index.php/stiinte_exacte_si_economice/article/view/348 |