scientific article; zbMATH DE number 6613883

zbMATH Open1349.90724MaRDI QIDQ2991763FDOQ2991763

Authors: Litie Tang, Lezhi Zhao 

Publication date: 10 August 2016

Title of this publication is not available (Why is that?)

Recommendations

• The traveling salesman problem. A computational study.
• On the approximability of the traveling salesman problem
• On the solution of traveling salesman problems
• scientific article; zbMATH DE number 4095236
• scientific article; zbMATH DE number 4202031
• The traveling salesman problem. I: Theoretical issues
• Complexity and approximation for traveling salesman problems with profits
• The traveling salesman problem. Approximate algorithms
• Approximation algorithms for the traveling salesman problem
• Aspects of the traveling salesman problem

zbMATH Keywords

computational complexitytraveling salesman problemNP problemP problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

This page was built for publication:

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