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.
Message board moderation
Author | Message |
---|---|
![]() ![]() Send message Joined: 10 Sep 05 Posts: 708 |
The TSP (Traveling Salesman Problem) project is using BOINC to find the shortest path between the capitals of the lower 48 states. |
Copyright © 2023 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.