An O(n log n) Heuristic for the Euclidean Traveling Salesman Problem

An O(n log n) Heuristic for the Euclidean Traveling Salesman Problem

Content
Grafik
Authors
  • Tutschku, Kurt
  • Yanenko, E.
  • Schuhmacher, E.
  • Spoerlein, U.
Grafik Top
Shortfacts
Category
 Technical Report (Technical Report)
Divisions
 Future Communication
Publisher
 University of Würzburg
Date
 2005
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.