## Complexity and Exact Solution Approaches to the Minimum Changeover Cost Arborescence Problem

We are given a digraph G = (N, A), where each arc is colored with one among k given colors. We look for a spanning arborescence T of G rooted at a given node and having minimum changeover cost. We call this the Minimum Changeover Cost Arborescence problem. To the authorsâ€™ knowledge, it is a … Read more