On Labeled Traveling Salesman Problems

DOI10.1007/978-3-540-92182-0_68MaRDI QIDQ3597879zbMATH OpenOpenAlexFDO

Authors Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis A. Telelis

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.7761

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Labeled traveling salesman problems: complexity and approximation
• The Colorful Traveling Salesman Problem
• On a Labeled Vehicle Routing Problem
• The traveling salesman problem with flexible coloring
• On the minimum label spanning tree problem

Cited in

(6)

• Labeled traveling salesman problems: complexity and approximation
• Comparison of heuristics for the colourful travelling salesman problem
• The Colorful Traveling Salesman Problem
• The Complexity of Bottleneck Labeled Graph Problems
• The maximum labeled path problem
• Approximation and hardness results for label cut and related problems

This page was built for publication: On Labeled Traveling Salesman Problems

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