Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
