TSP – Infrastructure for the Traveling Salesperson Problem
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the...
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
Foundation for Open Access Statistics
2007-11-01
|
| סדרה: | Journal of Statistical Software |
| נושאים: | |
| גישה מקוונת: | http://www.jstatsoft.org/v23/i02/paper |