Related articles:
Dynamic programming
Greedy algorithm
NP-complete
Hamiltonian path
Ant colony optimization
Genetic algorithm
Key terms:
tsp
optimal
heuristic
shortest
approximation
asymmetric
euclidean
triangle inequality
travelling salesman problem
lower bound
optimal tour
hamiltonian cycle
pheromone
bottleneck
traveling salesman problem
upper bound
approximation algorithm
graph theory
shortest tour
minimum spanning tree
asymmetric tsp
tour of length at most
disjoint
tsp tour
random path
finds a tour of length
shorter tour
combinatorial
euclidean tsp
eulerian cycle
good solutions
printed circuit
dantzig
yeo
tsp with triangle inequality
algorithm that finds a tour
nearest neighbour
optimal solution
euclidean distance
random search
cms press
circuit board
algorithm for tsp
problema del
distance between two cities
computational complexity
mts
ant colony optimization
pairwise
endpoints
Search external links cited by footnotes on Wikipedia page Travelling salesman problem:
|
|