Travelling salesman problem: on-paper algorithms

160 Views Asked by At

Are there any fast algorithms for solving the TSP on paper (without computer) given the matrix with weights of all edges. The matrix is non-symmetrical, meaning the road from $a$ to $b$ doesn't have the same weight as $b$ to $a$.

1

There are 1 best solutions below

0
On

The Christofides algorithm is easy to do without a computer.

Of course it is an approximation algorithm.