Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Traveling Salesman Problem

Showing: 27 courses
Mathologer

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

0 rewiews
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.
Add to list
9 Lesons
29 minutes
On-Demand
Free-Video

Dynamic Programming

0 rewiews
Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.
Add to list
8 Lesons
3 hours 30 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Reassembling Trees for the Traveling Salesman

0 rewiews
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
Add to list
8 Lesons
31 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

On LP-Relaxations for the Tree Augmentation Problem

0 rewiews
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.
Add to list
13 Lesons
33 minutes
On-Demand
Free-Video
International Mathematical Union

Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours

0 rewiews
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.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours

0 rewiews
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.
Add to list
1 Lesons
39 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

State Space Search: Problem-Solving Approaches and Examples

0 rewiews
Explore problem-solving techniques through state space search, from simple puzzles to complex real-world scenarios.
Add to list
19 Lesons
42 minutes
On-Demand
Free-Video
Institut des Hautes Etudes Scientifiques (IHES)

Mathematical Foundation of Various MCMC Methods

0 rewiews
Explore advanced MCMC methods for combinatorial optimization, including multi-spin flip techniques. Compare mathematical and numerical results to evaluate efficiency in different contexts.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Alan Turing Institute

Optimisation - Linear Integer Programming - Professor Raphael Hauser

0 rewiews
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.
Add to list
13 Lesons
52 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

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

0 rewiews
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.
Add to list
14 Lesons
40 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Reducing Path TSP to TSP

0 rewiews
Learn about reducing Path TSP to TSP, exploring canonical ideas, large distances, special cases, and practical examples in this concise algorithmic exploration.
Add to list
7 Lesons
25 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

0 rewiews
Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.
Add to list
19 Lesons
28 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

The Transformer Network for the Traveling Salesman Problem

0 rewiews
Explore how Transformer networks can tackle the Traveling Salesman Problem, improving upon existing heuristics with promising results for combinatorial optimization challenges.
Add to list
6 Lesons
30 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

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

0 rewiews
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.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Hausdorff Center for Mathematics

The Approximation Ratio of the k-Opt Heuristic for Euclidean TSP

0 rewiews
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.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

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

0 rewiews
Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.
Add to list
1 Lesons
1 hour 17 minutes
On-Demand
Free-Video
Reducible

The Traveling Salesman Problem - When Good Enough Beats Perfect

0 rewiews
Explore heuristic approaches and optimization techniques for the Traveling Salesman Problem, including nearest neighbor, greedy, Christofides, local search, simulated annealing, and ant colony optimization.
Add to list
12 Lesons
30 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Dynamic Programming - DAA

0 rewiews
Explore the Traveling Salesman Problem using dynamic programming, with practical examples to understand this classic optimization challenge in computer science.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Dynamic Programming - Directed Graph Example

0 rewiews
Explore the Traveling Salesman Problem using dynamic programming for directed graphs. Learn efficient solution techniques and practical applications in algorithm design and analysis.
Add to list
1 Lesons
26 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

Traveling Salesman Problem Using Branch and Bound - Least Cost Method

0 rewiews
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.
Add to list
1 Lesons
28 minutes
On-Demand
Free-Video
BSidesLV

Why It's All Snake Oil - And That May Be Ok

0 rewiews
Explore cybersecurity challenges, computational limitations, and the implications of "snake oil" solutions in modern technology and threat detection.
Add to list
16 Lesons
42 minutes
On-Demand
Free-Video
TheIACR

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

0 rewiews
Explore succinct non-interactive arguments of knowledge (SNARKs) for verifying program executions, focusing on TinyRAM architecture and concrete efficiency improvements.
Add to list
8 Lesons
21 minutes
On-Demand
Free-Video
Joint Mathematics Meetings

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

0 rewiews
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.
Add to list
14 Lesons
51 minutes
On-Demand
Free-Video
JSConf

Rendering Mona Lisa by Solving the Traveling Salesman Problem

0 rewiews
Explore how JavaScript tackles the Traveling Salesman Problem to create a unique rendition of the Mona Lisa, blending art, algorithms, and computational challenges.
Add to list
1 Lesons
19 minutes
On-Demand
Free-Video
Conf42

Quantum-Inspired Annealing: The State of Play

0 rewiews
Explore quantum-inspired annealing's current state, comparing quantum and classical approaches, and examining benchmarks for various optimization problems.
Add to list
18 Lesons
43 minutes
On-Demand
Free-Video
BIMSA

Classic Problems with Modern Techniques - Prize-collecting Framework

0 rewiews
Explore state-of-the-art approximation algorithms for classic network design problems using modern techniques, from clustering to recursive methodologies.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Centrum Fizyki Teoretycznej PAN

Quantum Algorithms for Search and Optimization

0 rewiews
Explore quantum algorithms for search and optimization, including recent advancements in random walk speedups, NP-complete problem improvements, and geometric problem solutions.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video