NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 84
  • 33
  • 32
  • 11
  • 9
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 212
  • 212
  • 147
  • 69
  • 58
  • 37
  • 35
  • 35
  • 32
  • 31
  • 30
  • 30
  • 26
  • 25
  • 25
  • 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 212 (0.069 seconds)
1

Heuristic approaches for routing optimisation

Keuthen, Ralf January 2003 (has links)
No description available.
621.381531
Travelling salesman problem
2

An analysis of various aspects of the traveling saleman problem /

Akl, Selim G. January 1978 (has links)
No description available.
Traveling-salesman problem.
3

On the solution of traveling salesman problems under conditions of sparseness

Bau, Norman Jon 12 1900 (has links)
No description available.
Traveling-salesman problem
4

An analysis of various aspects of the traveling saleman problem /

Akl, Selim G. January 1978 (has links)
No description available.
Traveling-salesman problem.
5

Kandidatenmengen für das TSP ein neuer heuristischer Ansatz

Rohleder, 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
Travelling-salesman-Problem Heuristik
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).
Travelling-salesman-Problem. Heuristik.
7

An algorithm to solve traveling-salesman problems in the presence of polygonal barriers

Gupta, Anil K. January 1985 (has links)
Thesis (M.S.)--Ohio University, March, 1985. / Title from PDF t.p.
Traveling-salesman problem. Algorithms.
8

An algorithm for solving the traveling-salesman problem with three-dimensional polygonal barriers

Lee, Yen-Gi. January 1992 (has links)
Thesis (M.S.)--Ohio University, November, 1992. / Title from PDF t.p.
Traveling-salesman problem. Algorithms.
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.
Traveling-salesman problem.
10

Algorithmic and probabilistic aspects of the bipartite traveling salesman problem

Baltz, Andreas. January 2001 (has links) (PDF)
Kiel, University, Diss., 2001.
Travelling-salesman-Problem

Page generated in 0.0738 seconds