 |
|
Innovation award
 Nominee: 5x |
This class can solve salesman travel problem using the Christofides heuristic.
It takes a list of point through which the salesman needs to pass.
The class can use the Christofides heuristic to find a path with a cost that is at most 3/2 of the optimal cost.
|
|
| Name: |
Christofides heuristic |
| Base name: |
christofides |
| Description: |
Solve salesman travel with Christofides heuristic |
| Version: |
0.1 |
| PHP version: |
3.0 |
| License: |
Free For Educational Use |
| All time users: |
330 users |
| All time rank: |
5964 |
| Week users: |
2 users |
| Week rank: |
1324  |
| |
|
 May 2011
Number 5
Prize: One downloadable copy of Komodo IDE |
The salesman travel is a classic computing problem which consists in finding an optimized route that a salesman can follow to visit a set of cities with the minimum travel cost.
This class implements a solution for the salesman travel problem using the Christofides heuristic.
Manuel Lemos |
| Not yet rated by the users |
| |
Applications that use this class |
|
|
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.
| |
Files |
|
|