Home▸Algorithms & AI▸Traveling Salesperson Problem Visual Route: Heuristics, Exact Held-Karp and Lower Bounds

🗺️ Traveling Salesperson Problem Visual Route: Heuristics, Exact Held-Karp and Lower Bounds

Interactive traveling salesperson problem: nearest neighbour, greedy edge, 2-opt, Or-opt, simulated annealing and exact Held-Karp, with MST and 1-tree lower bounds and in-page numerical checks.

Algorithms & AI2DModerate60 FPS📱 Mobile-adapted
Traveling Salesperson Problem Visual Route: Heuristics, Exact Held-Karp and Lower Bounds ↗ Open standalone
⚙ Under the hood

Interactive traveling salesperson lab: nearest neighbour, greedy edge, 2-opt, Or-opt, simulated annealing and the exact Held-Karp solver on an editable map, with MST and 1-tree lower bounds and three in-page checks.

Traveling Salesperson2-optSimulated AnnealingHeld-KarpNP-hard

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)