![]() | PDF (214kB) - Repository staff only |
- DOI to cite this document:
- 10.5283/epub.16272
Alternative links to fulltext:DOI
Abstract
A problem often considered in operations research and computational physics is the traveling salesman problem, in which a traveling salesperson has to find the shortest closed tour between a certain set of cities. This problem has been extended to more realistic scenarios, e.g., the "real" traveling salesperson has to take rush hours into consideration. We will show how this extended problem is ...

Owner only: item control page