Get Free Access for 10 Days!
eBook

Mathigon: Graphs and Networks: The Travelling Salesman Problem

Curated by ACT

This lesson focuses on the traveling salesman problem which involves finding paths through a city without backtracking. While no algorithm has been found to do that for all cities, there are algorithms that help somewhat. They are discussed in this lesson.

3 Views 0 Downloads
Concepts
heuristics
Show More Show Less
Additional Tags
2-opt algorithm, ant colony system (acs) algorithms, graphs and networks, greedy algorithm, hamiltonian cycles, mathigon.org, mathigon: graphs and networks: the travelling salesman problem, the travelling salesman problem, networks
Show More Show Less
Classroom Considerations
  • Knovation Readability Score: 3 (1 low difficulty, 5 high difficulty)
  • The intended use for this resource is Instructional|practice