- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 10 of 210 (0.069 seconds)| 1 |
Heuristic approaches for routing optimisationKeuthen, Ralf January 2003 (has links)
No description available.
|
| 2 |
An analysis of various aspects of the traveling saleman problem /Akl, Selim G. January 1978 (has links)
No description available.
|
| 3 |
On the solution of traveling salesman problems under conditions of sparsenessBau, Norman Jon 12 1900 (has links)
No description available.
|
| 4 |
An analysis of various aspects of the traveling saleman problem /Akl, Selim G. January 1978 (has links)
No description available.
|
| 5 |
Kandidatenmengen für das TSP ein neuer heuristischer AnsatzRohleder, Andreas January 2005 (has links)
Zugl.: Münster (Westfalen), Univ., Diss., 2005 u.d.T.: Rohleder, Andreas: Ein Vorschlag zur Erzeugung von Kandidatenmengen zur Unterstützung der heuristischen Lösung des geometrischen zweidimensionalen Traveling Salesman Problems
|
| 6 |
Kandidatenmengen für das TSP : ein neuer heuristischer Ansatz /Rohleder, Andreas. January 2006 (has links)
Universiẗat, Diss., 2005 u.d.T.: Rohleder, Andreas: Ein Vorschlag zur Erzeugung von Kandidatenmengen zur Unterstützung der heuristischen Lösung des geometrischen zweidimensionalen Traveling Salesman Problems--Münster (Westfalen).
|
| 7 |
An algorithm to solve traveling-salesman problems in the presence of polygonal barriersGupta, Anil K. January 1985 (has links)
Thesis (M.S.)--Ohio University, March, 1985. / Title from PDF t.p.
|
| 8 |
An algorithm for solving the traveling-salesman problem with three-dimensional polygonal barriersLee, Yen-Gi. January 1992 (has links)
Thesis (M.S.)--Ohio University, November, 1992. / Title from PDF t.p.
|
| 9 |
The traveling salesman problem : deceptively easy to state; notoriously hard to solve /Biron, David. January 2006 (has links)
Thesis (Honors)--Liberty University Honors Program, 2006. / Includes bibliographical references. Also available through Liberty University's Digital Commons.
|
| 10 |
Algorithmic and probabilistic aspects of the bipartite traveling salesman problemBaltz, Andreas. January 2001 (has links) (PDF)
Kiel, University, Diss., 2001.
|
Page generated in 0.073 seconds