On Minimum Changeover Cost Arborescences

  title={On Minimum Changeover Cost Arborescences},
  author={Giulia Galbiati and Stefano Gualandi and Francesco Maffioli},
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 new problem. The concept of changeover costs is similar to the one, already considered in the literature, of reload costs, but the latter depend also on the amount of commodity flowing in the arcs and… CONTINUE READING