Traveling Salesperson Problem — Study Resources & PYQs
Traveling salesperson problem
- Estimated study time: 50 minutes
Study resources
- Traveling Salesperson Problem (Branch & Bound) (Article) — TSP solved with Branch & Bound: reduced cost matrix, bounding, and optimal tour extraction.
- Traveling Salesperson Problem (Branch & Bound) (Video) — Visual video walkthrough of TSP using Branch & Bound by Abdul Bari with matrix reduction.
- Full Branch & Bound (Knapsack + TSP) (Video) — Complete playlist covering Branch & Bound: 0/1 Knapsack and Travelling Salesman with examples.
Taught in these subjects
- Analysis & Design of Algorithms — CST-3501 · Government College of Engineering and Technology, Jammu