Home >> Computing >> Travelling Salesman

Travelling Salesman

Description:

This design is a reference to the Travelling Salesman Problem, a classic in computer science: given a list of cities, the task is to find a shortest possible tour that visits each city exactly once.

Suitable for:

Computer science students/grads, mathematicians, programmers and geeks.

Customers who bought this item also bought: