Approximation Algorithms for the Black and White Traveling Salesman Problem

DOI10.1007/978-3-540-73545-8_54MaRDI QIDQ3608879zbMATH OpenOpenAlexFDO

Authors

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_54

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for the black and white traveling salesman problem
• The Black and White Traveling Salesman Problem
• A new formulation and approach for the black and white traveling salesman problem
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
• Labeled traveling salesman problems: complexity and approximation

Cited in

(5)

• Solving shortest path problems with a weight constraint and replenishment arcs
• The Black and White Traveling Salesman Problem
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
• A new formulation and approach for the black and white traveling salesman problem
• Heuristics for the black and white traveling salesman problem

Describes a project that uses

Uses Software

• TSPLIB
• SONET

This page was built for publication: Approximation Algorithms for the Black and White Traveling Salesman Problem

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