Search
Now showing items 1-2 of 2
Primal and Lagrangian heuristics for minimum weight rooted arborescence problem
(2010-07-27)
Consider a rooted acyclic graph G with weights on arcs. In this graph, a minimum weight rooted arborescence (MRC) can be defined as one whose sum of arc weights is less than or equal to that of any other rooted arborescence ...
The minimum weight rooted arborescence problem: weights on ARCS case
(2010-03-24)
In a rooted acyclic graph, G, there exits, in general, several rooted (not necessarily spanning) arborscences. Depending on whether the graph has weights on nodes, on arcs, or on both, it is possible to define, with different ...