Comparison of Heuristics for the Colorful Traveling Salesman Problem

Abstract

In the Colorful Traveling Salesman Problem (CTSP), given a graph G with a (not necessarily distinct) label (color) assigned to each edge, a Hamiltonian tour with the minimum number of different labels is sought. The problem is a variant of the well-known Hamiltonian Cycle problem and has potential applications in telecommunication networks, optical networks… (More)

8 Figures and Tables

Topics

  • Presentations referencing similar topics