A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
type: Item
instance of: scholarly article
title: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
zbMATH Open document ID: 0848.90117
DOI: 10.1016/0166-218X(95)00054-U
author: Igor Averbakh
author: Oded Berman
published in: Discrete Applied Mathematics
publication date: 1996-08-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 897431
zbMATH Keywords: two tavelling salesmen
zbMATH Keywords: NP-hard
zbMATH Keywords: heuristic
zbMATH Keywords: worst-case relative error
MaRDI profile type: Publication
cites work: Q4198056
description: scientific article; zbMATH DE number 897431