Buscar
Mostrando ítems 1-3 de 3
Artículo
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
(Wiley, 2008)
This paper deals with the following graph partitioning problem. Consider a connected graph with n nodes, p of which are centers, while the remaining ones are units. For each unit-center pair there is a fixed service cost ...
Artículo
The continuous and discrete path variance problem on trees
(Wiley, 2009-03)
In this paper we consider the problem of locating path-shaped facilities on a tree minimizing the variance objective function. This kind of objective function is generally adopted in location problems which arise in the ...
Artículo