Traveling Salesman Problem-Problem Statement and Applications
Delivery Problem
()
Shortest Common Superstring Problem
()
Additional Materials
Traveling Salesman Problem-Algorithms: First Steps
Brute Force Search
()
Nearest Neighbor
()
Exact Algorithms-Exact Algorithms: Branch and Bound
Branch and Bound
()
Exact Algorithms-Exact Algorithms: Dynamic Programming (Optional)
Dynamic Programming: Main Ideas
()
Dynamic Programming: Representing Subsets
()
Dynamic Programming: Code
()
Approximation Algorithms-Approximation Algorithms
Approximation Algorithms
()
Local Search
()