Travelling Salesperson Problem — Study Resources & PYQs
Travelling salesperson problem.
- Estimated study time: 30 minutes
Study resources
- Konigsberg bridge problem, Chinese Postman problem, Travelling Salesperson problem - Gajendra Purohit (Video) — Introduces the Travelling Salesperson Problem (finding the shortest Hamiltonian circuit) and why it is computationally hard.
Travelling Salesperson Problem previous year questions
- (a) What is Traveling - Salesman Problem? (b) Prove that every connected graph has at least one spanning tree. (c) Prove that any connected graph with n vertic…
- (a) Find the shortest path in the given below weighted graph : (A is the starting point). (b) What is Travelling-Salesman problem ? (c) Prove that a tree with…
Taught in these subjects
- Discrete Mathematics — BST8401 · Government College of Engineering and Technology, Jammu