On Minimum Reload Cost Cycle Cover

We consider the problem of spanning the nodes of a given colored graph G = ( N , A ) by a set of node-disjoint cycles at minimum reload cost, where a reload cost is paid whenever passing through a node where the two consecutive arcs have different colors. We analyze the complexity of the problem, present some integer programming formulations, and report on preliminary computational results.