On some multicriteria arborescence problems: Complexity and algorithms Original Research Article

The problems of finding an optimum arborescence of a given digraph with respect to an objective function obtained combining linearly two (or more) objective functions of various kinds are studied.