Traveling Salesman Problem Courses and Certifications

Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.

• YouTube
• 40 minutes
• On-Demand
• Free Video

MUNI Seminar Series

The Traveling Salesman Problem - Package Deliveries, Pub Walks, and Astro Tours

Explore how modern algorithms solve the Traveling Salesman Problem, from Amazon deliveries to mapping 136 million stars, debunking computational complexity myths.

• YouTube
• 56 minutes
• On-Demand
• Free Video

Reducible

The Traveling Salesman Problem - When Good Enough Beats Perfect

Explore heuristic approaches and optimization techniques for the Traveling Salesman Problem, including nearest neighbor, greedy, Christofides, local search, simulated annealing, and ant colony optimization.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Beating the Integrality Ratio for S-T-Tours in Graphs

Explores a novel algorithm for the s-t-path graph TSP, achieving a 1.497 approximation ratio and surpassing the known integrality ratio of 3/2 through innovative techniques.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Alan Turing Institute

Optimisation - Linear Integer Programming - Professor Raphael Hauser

Explore linear integer programming, mixed integer models, and branch-and-bound algorithms for solving complex optimization problems in supply chain management and traveling salesman scenarios.

• YouTube
• 52 minutes
• On-Demand
• Free Video

Joint Mathematics Meetings

Information, Computation, Optimization - Connecting the Dots in the Traveling Salesman Problem

Explore optimization techniques and their applications in solving complex problems like the Traveling Salesman, with insights from William Cook's research and real-world examples.

• YouTube
• 51 minutes
• On-Demand
• Conference Talk

JSConf

Rendering Mona Lisa by Solving the Traveling Salesman Problem

Explore how JavaScript tackles the Traveling Salesman Problem to create a unique rendition of the Mona Lisa, blending art, algorithms, and computational challenges.

• YouTube
• 19 minutes
• On-Demand
• Conference Talk

Institute for Pure & Applied Mathematics (IPAM)

The Transformer Network for the Traveling Salesman Problem

Explore how Transformer networks can tackle the Traveling Salesman Problem, improving upon existing heuristics with promising results for combinatorial optimization challenges.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Branch and Bound - Least Cost Method

Learn to solve the Traveling Salesman Problem using Branch and Bound method, focusing on the Least Cost approach. Explore efficient algorithms for optimizing routes in complex networks.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Dynamic Programming - DAA

Explore the Traveling Salesman Problem using dynamic programming, with practical examples to understand this classic optimization challenge in computer science.

• YouTube
• 41 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Dynamic Programming - Directed Graph Example

Explore the Traveling Salesman Problem using dynamic programming for directed graphs. Learn efficient solution techniques and practical applications in algorithm design and analysis.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Asymptotic Dimension, Isoperimetric Problem, and Traveling Salesman Problem in Groups

Explore connections between asymptotic dimension, isoperimetric problems, and traveling salesman problems in group theory through advanced mathematical analysis.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Delivery Problem

376 ratings at Coursera

Implement efficient Python programs for the traveling salesman problem, exploring exact and approximation algorithms while applying discrete mathematics concepts.

• Coursera
• 13 hours 23 minutes
• On-Demand
• Paid Course

Combinatorial Problems and Ant Colony Optimization Algorithm

494 ratings at Udemy

Let's learn Artificial Intelligence search methods: optimization, exact algorithms, heuristics, and metaheuristics

• Udemy
• 4 hours 58 minutes
• On-Demand
• Paid Course

Hill Climbing and Simulated Annealing AI Algorithms

101 ratings at Udemy

A micro-credential for learning Inspirations, theories, mathematical models, and applications of HC and SA algorithms

• Udemy
• 3 hours 29 minutes
• On-Demand
• Paid Course