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.
Dynamic Programming
Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.
Reassembling Trees for the Traveling Salesman
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
On LP-Relaxations for the Tree Augmentation Problem
Explore LP-relaxations for tree augmentation, including dual-fitting algorithms, shadow-minimal solutions, and blocking trees. Gain insights into improved approximation techniques for combinatorial optimization problems.
Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
State Space Search: Problem-Solving Approaches and Examples
Explore problem-solving techniques through state space search, from simple puzzles to complex real-world scenarios.
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.
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.
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.
Reducing Path TSP to TSP
Learn about reducing Path TSP to TSP, exploring canonical ideas, large distances, special cases, and practical examples in this concise algorithmic exploration.
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.
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.
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.
The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP
Explore the k-Opt heuristic's approximation ratio for Euclidean TSP, improving upper bounds and providing new lower bounds for k ≥ 3, applicable to various p-norms.
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.
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.
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.
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.
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.
Why It's All Snake Oil - And That May Be Ok
Explore cybersecurity challenges, computational limitations, and the implications of "snake oil" solutions in modern technology and threat detection.