GitHub

adamgracikowski/tsp-approximation-comparison

A comprehensive implementation and performance analysis of approximation algorithms for the Metric Traveling Salesperson Problem (TSP). This project compares the classic 2-approximation (Double-Tree) ...
The Next Web

At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem

Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got ...
GIGAZINE

The best algorithm for finding an approximate solution to the difficult mathematical problem 'Traveling Salesman Problem' is updated for the first time in decades

The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...
IEEE

A New Heuristic Algorithm Based on Christofides Algorithm and Nearby Measures for TSP Problem

Abstract: In order to solve the NP hard problem of TSP problem, this paper proposes the C-N-GA (Christofides Algorithm& Nearby Measures & Genetic Algorithm) algorithm that combines the Christofides ...