Approximation schemes for the generalized traveling salesman problem

DOI10.1134/S0081543817090127zbMath1390.68764MaRDI QIDQ1744982

Katherine Neznakhina, Mikhail Yu. Khachay

Publication date: 20 April 2018

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-hard problem; polynomial-time approximation scheme; generalized traveling salesman problem

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Uses Software

• GTSP Instances Library