CSERD: Parallel Traveling Salesman Problem

Title	Parallel Traveling Salesman Problem
Url	http://cserd.nsdl.org/Resources/Models/TravelingSalesman/index.php
Creator	David Joiner, Jonathan Hassinger
Contributor	None listed
Publisher	None listed
Description	The traveling salesman problem is a classic optimization problem in which one seeks to minimize the path taken by a salesman in traveling between N cities, where the salesman stops at each city one and only one time, never retracing his/her route. This implementation is designed to run on UNIX systems with X-Windows, and includes parallelization using MPI.
Format	None listed
Language	English
Subject	Computational Science, Mathematics
Keyword	None listed
Audience	Educator, Learner/Student
Education Level	Higher Education, High School, Grade 12, Grade 11, Grade 10, Graduate/Professional
Type	Software, Instructional Material