Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

The Traveling Salesman Problem - When Good Enough Beats Perfect

Reducible via YouTube

Start learning Write review
Scrimba Ad

Get 20% off all career paths from fullstack to AI

Learn More → Corporate Finance Institute Ad

Finance Certifications Goldman Sachs and Amazon Teams Trust

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This course explains why finding an exact solution to the Traveling Salesman Problem becomes impractical for large instances. It presents heuristic, approximation, local-search, simulated-annealing, and ant-colony methods for constructing and improving reasonably good tours.

Syllabus

Intro
Problem Definition
Why Finding Optimal Solution Is Practically Impossible
Nearest Neighbor Heuristic
Lower Bounding TSP
Greedy Heuristic
Christofides Algorithm
Sponsor CuriosityStream
Tour Improvements
Simulated Annealing
Ant Colony Optimization
Conclusion

Taught by

Reducible

Reviews

Start your review of The Traveling Salesman Problem - When Good Enough Beats Perfect

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.