1. Home
  2. Material Detail: The Travelling Salesman Problem

Material Detail

The Travelling Salesman Problem

The Travelling Salesman Problem

TeachSpatial resources for spatial teaching and learningThe Traveling Salesman Problem is one of the most intensively studied problems in computational mathematics. These pages are devoted to the history, applications, and current research of this challenge of finding the shortest route visiting each member of a collection of locations and returning to your starting point....

Show More
Keywords:
Social Sciences, Network, Geoscience, Geography, NSDL, Mathematics
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Simulation
Date Added to MERLOT:
July 27, 2016
Date Modified in MERLOT:
July 27, 2016
Author:
Submitter:
Barbra Bied Sperling
Hispanic Serving Institution
Primary Audience:
Graduate School, Professional
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
Unknown
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Unknown

Browse...

Disciplines with similar materials as The Travelling Salesman Problem
People who viewed this also viewed
Other materials like The Travelling Salesman Problem

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.