Browsing Working Papers by Subject "Lagrangian relaxation"
Now showing items 1-1 of 1
-
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 ...