( ! ) Notice: session_start() [function.session-start]: Server 127.0.0.1 (tcp 21201) failed with: Failed reading line from stream (0) in /var/www/html/refdesk/app/control/session.php5 on line 21
Call Stack
#TimeMemoryFunctionLocation
10.000676448{main}( )../fullRecordSummary.php5:0
20.0011132280include_once( '/var/www/html/refdesk/config/standardIncludes.php5' )../fullRecordSummary.php5:12
30.05376733872include_once( '/var/www/html/refdesk/app/control/session.php5' )../standardIncludes.php5:98
40.05496893256session_start ( )../session.php5:21
CSERD: Parallel Traveling Salesman Problem

CSERD


  • userhome
  • catalog
  • resources
  • help

Parallel Traveling Salesman Problem


Shodor > CSERD > Catalog > Parallel Traveling Salesman Problem

  • summary
  • readreviews
  • addreviews

TitleParallel Traveling Salesman Problem
Urlhttp://cserd.nsdl.org/Resources/Models/TravelingSalesman/index.php
CreatorDavid Joiner, Jonathan Hassinger
ContributorNone listed
PublisherNone listed
DescriptionThe 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.
FormatNone listed
LanguageEnglish
SubjectComputational Science, Mathematics
KeywordNone listed
AudienceEducator, Learner/Student
Education LevelHigher Education, High School, Grade 12, Grade 11, Grade 10, Graduate/Professional
TypeSoftware, Instructional Material

Not Logged In. Login
©1994-2025 Shodor    Licensing