Traveling Saleman Problem (TSP)

Card Puncher Data Processing

About

The TSP is not NP Complete but NP hard.

Simulation

See AgentScript model

Documentation / Reference





Discover More
Sorting Quicksort Anim
Algorithm - NP Complete (Nondeterministic Polynomial Time Complete)

This is a class of problems that are so difficult that even the best solutions cannot consistently determine their solutions in an efficient way. Specifically, NP Complete problems can only possibly...



Share this page:
Follow us:
Task Runner