Message boards : News : The TSP (Traveling Salesman Problem) project is using BOINC to find the shortest path between the capitals of the lower 48 states.

Author | Message |
---|---|

David Anderson Volunteer moderator Project administrator Project developer Send message Joined: 10 Sep 05 Posts: 621 |
The TSP (Traveling Salesman Problem) project is using BOINC to find the shortest path between the capitals of the lower 48 states. |

Message boards : News : The TSP (Traveling Salesman Problem) project is using BOINC to find the shortest path between the capitals of the lower 48 states.

Copyright © 2017 University of California. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.