The Traveling Salesman Problem with Distances One and Two

• 1 February 1993
• journal article
• Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
• Vol. 18  (1) , 1-11
• https://doi.org/10.1287/moor.18.1.1

Abstract

Keywords

• TRAVELING SALESMAN PROBLEM
• DISTANCES
• MAX SNP
• APPROXIMATION SCHEME
• SNP HARD
• WORST CASE