The traveling salesman problem with flexible coloring

DOI10.1016/J.DAM.2012.03.004zbMATH Open1247.90278OpenAlexW3122056001MaRDI QIDQ444446FDOQ444446

Authors Thomas A. Roemer, Sriram Dasu, Reza Ahmadi

Publication date 14 August 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.03.004

zbMATH Keywords

heuristicserror boundscomplexitytraveling salesman problemprobabilistic analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The Colorful Traveling Salesman Problem
• A colored traveling salesman problem with varying city colors
• Labeled traveling salesman problems: complexity and approximation
• Comparison of heuristics for the colourful travelling salesman problem
• The Black and White Traveling Salesman Problem

Cites work

• scientific article; zbMATH DE number 3918121 (Why is no real title available?)
• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A probability path
• An emergency vehicle dispatching system for an electric utility in Chile
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Applied integer programming. Modeling and solution.
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
• Optimization, approximation, and complexity classes
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Restricted delivery problems on a network
• Routing heuristics for automated pick and place machines
• Some APX-completeness results for cubic graphs
• Some applications of the clustered travelling salesman problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The optimum execution order of queries in linear storage
• The traveling-salesman problem

Cited in

(11)

• The family traveling salesman problem with incompatibility constraints
• Labeled traveling salesman problems: complexity and approximation
• The Black and White Traveling Salesman Problem
• Solving the family traveling salesman problem
• The Colorful Traveling Salesman Problem
• A reduction heuristic for the all-colors shortest path problem
• On Labeled Traveling Salesman Problems
• A colored traveling salesman problem with varying city colors
• Comparison of heuristics for the colourful travelling salesman problem
• Efficient formulations for the traveling car renter problem and its quota variant
• Heuristics for the black and white traveling salesman problem

This page was built for publication: The traveling salesman problem with flexible coloring

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