The Colorful Traveling Salesman Problem

DOI10.1007/978-0-387-48793-9_8MaRDI QIDQ3439974zbMATH OpenOpenAlexFDO

Authors Yupei Xiong, Bruce Golden, Edward Wasil

Publication date 21 May 2007

Published in Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-48793-9_8

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Comparison of heuristics for the colourful travelling salesman problem
• On Labeled Traveling Salesman Problems
• Labeled traveling salesman problems: complexity and approximation
• The traveling salesman problem with flexible coloring
• On a Labeled Vehicle Routing Problem

Cited in

(19)

• The labeled maximum matching problem
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
• On the complexity of rainbow spanning forest problem
• The rainbow spanning forest problem
• Labeled traveling salesman problems: complexity and approximation
• Efficient formulations for the traveling car renter problem and its quota variant
• A colored traveling salesman problem with varying city colors
• Two heuristics for the rainbow spanning forest problem
• Minimum label \(s\)-\(t\) cut has large integrality gaps
• Comparison of heuristics for the colourful travelling salesman problem
• Computing shortest heterochromatic monotone routes
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
• The label cut problem with respect to path length and label frequency
• On Labeled Traveling Salesman Problems
• The traveling salesman problem with flexible coloring
• A reduction heuristic for the all-colors shortest path problem
• Comparison of metaheuristics for the k-labeled spanning forest problem
• Colored points traveling salesman problem
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants

This page was built for publication: The Colorful Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439974)