An Analysis of Several Heuristics for the Traveling Salesman Problem
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by th...
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by th...
h-index: Number of publications with at least h citations each.