CSERD
  • userhome
  • catalog
  • resources
  • help

Parallel Traveling Salesman Problem
Shodor > CSERD > Catalog > Parallel Traveling Salesman Problem
  • summary
  • readreviews
  • addreviews
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: EN
Subject: Computational Science, Mathematics
Keywords: none listed
Audience: Educator, Student
Education Level: Grades 10-12, Graduate, Undergraduate
Resource Type: Software
Not Logged In. Login
©1994-2007 Shodor