Type:

E-book, Other

Description:

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.

Subjects:

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

Education Levels:

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

Keywords:

Algorithm

Language:

English

Access Privileges:

Members

License Deed:

Creative Commons Attribution 3.0

Collections:

None
This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
NR
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467