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

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

zbMATH Keywords

heuristicserror boundscomplexitytraveling salesman problemprobabilistic analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization, approximation, and complexity classes
• Some APX-completeness results for cubic graphs
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Title not available (Why is that?)
• An emergency vehicle dispatching system for an electric utility in Chile
• The traveling-salesman problem
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Restricted delivery problems on a network
• Some applications of the clustered travelling salesman problem
• A probability path
• The optimum execution order of queries in linear storage
• Routing heuristics for automated pick and place machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Applied integer programming. Modeling and solution.

Cited In (11)

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