Travelling Salesman Problem (TSP) Courses and Certifications

Graph Theory

Comprehensive exploration of graph theory algorithms, covering search, shortest paths, trees, topological sorting, network flow, and more, with practical implementations and problem-solving techniques.

• YouTube
• 8 hours
• Self-Paced
• Free Video

Coding Train

Intelligence and Learning - Nature of Code Part 2

Explore algorithms, genetic programming, and neural networks through hands-on coding challenges covering pathfinding, machine learning, and evolutionary systems.

• YouTube
• 19 hours 12 minutes
• Self-Paced
• Free Video

Coding Train

Algorithms and Graphs - Intelligence and Learning - Session 1

Explore algorithms and graph theory through hands-on coding challenges including binary trees, pathfinding, maze generation, and the traveling salesperson problem.

• YouTube
• 4 hours 55 minutes
• Self-Paced
• Free Video

Coding Train

Genetic Algorithms - Intelligence and Learning - Session 2

Explore genetic algorithms through hands-on coding challenges, from Shakespeare monkey examples to traveling salesperson problems and evolutionary steering behaviors.

• YouTube
• 5 hours 52 minutes
• Self-Paced
• Free Video

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
• Self-Paced
• Paid Course

Mathologer

What Is the Best Way to Lace Your Shoes? Dream Proof

Explore mathematical shoe lacing methods, from shortest to longest, and their real-world applications. Discover how dream-inspired proofs can lead to surprising insights in this accessible and engaging math journey.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

Academic Lesson

Graph Theory Full Course for Beginners

Comprehensive introduction to graph theory, covering key concepts, algorithms, and applications. Ideal for beginners seeking a solid foundation in this fundamental area of discrete mathematics.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• 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
• Self-Paced
• Conference Talk

NPTEL-NOC IITM

State Space Search: Problem-Solving Approaches and Examples

Explore problem-solving techniques through state space search, from simple puzzles to complex real-world scenarios.

• YouTube
• 42 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• Free Video

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
• Self-Paced
• Conference Talk

TheIACR

SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge

Explore succinct non-interactive arguments of knowledge (SNARKs) for verifying program executions, focusing on TinyRAM architecture and concrete efficiency improvements.

• YouTube
• 21 minutes
• Self-Paced
• Conference Talk

Institut des Hautes Etudes Scientifiques (IHES)

Mathematical Foundation of Various MCMC Methods

Explore advanced MCMC methods for combinatorial optimization, including multi-spin flip techniques. Compare mathematical and numerical results to evaluate efficiency in different contexts.

• YouTube
• 51 minutes
• Self-Paced
• Free Video

Confreaks

Simulated Annealing: The Most Metal Algorithm Ever - Lecture

1 rating

Explore simulated annealing algorithm for near-optimal solutions in constrained optimization problems, inspired by metallurgy and applicable to Ruby apps.

• YouTube
• 28 minutes
• Self-Paced
• Free Video