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