![]() | PDF (1MB) - Nur für Mitarbeiter des Archivs |
- DOI zum Zitieren dieses Dokuments:
- 10.5283/epub.16102
Alternative Links zum Volltext:DOI
Zusammenfassung
The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP ...
![plus plus](/style/images/plus.png)
Nur für Besitzer und Autoren: Kontrollseite des Eintrags