July 17, 2009

The traveling sales person problem is an ideal example of dynamic programming. It is helpful for finding the shortest path between initial and final points.

- Career & Technical Education > General
- Mathematics > General
- Science > General

- Grade 11
- Grade 12
- Higher Education
- Graduate
- Undergraduate-Upper Division
- Undergraduate-Lower Division