Traveling Salesman Problem Courses
Institute for Pure & Applied Mathematics (IPAM) via YouTube Reassembling Trees for the Traveling Salesman
Hausdorff Center for Mathematics via YouTube On LP-Relaxations for the Tree Augmentation Problem
Hausdorff Center for Mathematics via YouTube Computational Complexity in Theory and in Practice by Richard M. Karp
International Centre for Theoretical Sciences via YouTube Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours
International Mathematical Union via YouTube The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP
Hausdorff Center for Mathematics via YouTube Beating the Integrality Ratio for S-T-Tours in Graphs
Hausdorff Center for Mathematics via YouTube Rendering Mona Lisa by Solving the Traveling Salesman Problem
JSConf via YouTube SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge
TheIACR via YouTube Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours
Hausdorff Center for Mathematics via YouTube