Travelling Salesman

Description:
The Travelling Salesman Problem is one of the classics in computer science: Given a list of cities and their pairwise distances, 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.

Technical Specifications:
Durable flex print; 3 colors.

Didn't find the right colors or type of apparel?

shop::categories