Travelling Salesman Problem
# Travelling Salesman Problem
“Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?”
# Problem Formulation
# Strategy
# Pseudocode
# Greedy Heuristics
Nearest Neighbour:
