Abstract
Given a connected, undirected graph G whose edges are labeled (or colored), the colorful traveling salesman problem (CTSP) seeks a Hamiltonian tour of G with the minimum number of distinct labels (or colors). We prove that the CTSP is NP-complete and we present a heuristic algorithm and a genetic algorithm to solve the problem. © 2007 by Springer Science+Business Media, LLC.
Author supplied keywords
Cite
CITATION STYLE
APA
Xiong, Y., Golden, B., & Wasif, E. (2007). The colorful traveling salesman problem. Operations Research/ Computer Science Interfaces Series, 37, 115–123. https://doi.org/10.1007/978-0-387-48793-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free