The traveling salesman problem with flexible coloring

DOI10.1016/j.dam.2012.03.004zbMath1247.90278MaRDI QIDQ444446

Sriram Dasu, Thomas A. Roemer, Reza H. 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

complexity; heuristics; error bounds; probabilistic analysis; traveling salesman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Cites Work

• A probability path
• The optimum execution order of queries in linear storage
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Optimization, approximation, and complexity classes
• Some APX-completeness results for cubic graphs
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• Routing heuristics for automated pick and place machines
• An emergency vehicle dispatching system for an electric utility in Chile
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
• Some applications of the clustered travelling salesman problem
• The Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item