Heuristics for the black and white traveling salesman problem
type: Item
instance of: scholarly article
title: Heuristics for the black and white traveling salesman problem
zbMATH Open document ID: 1029.90061
DOI: 10.1016/S0305-0548(01)00082-X
author: Mélanie Bourgeois
author: G. Laporte
author: F. Semet
published in: Computers \& Operations Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 1902962
zbMATH Keywords: Traveling salesman problem
zbMATH Keywords: Heuristics
zbMATH Keywords: telecommunication network design
zbMATH Keywords: aircraft maintenance stops
describes a project that uses: SONET
MaRDI profile type: Publication
cites work: An algorithm for designing rings for survivable fiber networks
cites work: The four-day aircraft maintenance routing problem
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Computer Solutions of the Traveling Salesman Problem
description: scientific article; zbMATH DE number 1902962