Related articles:
Nearest neighbour algorithm
Greedy algorithm
Dynamic programming
Route inspection problem
Hamiltonian path problem
NP-complete
Hamiltonian path
Christofides algorithm
George Dantzig
Cutting stock problem
Genetic algorithm
Vehicle routing problem
Brian Kernighan
Key terms:
tsp
algorithm
travelling
metric
salesman
edges
optimal
heuristic
salesman problem
approximation
computational
euclidean
travelling salesman problem
asymmetric
triangle inequality
hamiltonian
graph theory
minimum spanning tree
lower bound
traveling salesman problem
eulerian
approximation algorithm
pheromone
ant colony
hamiltonian cycle
bottleneck
upper bound
eulerian cycle
printed circuit
euclidean distance
problema
weighted graph
dynamic programming
nearest neighbour
fulkerson
disjoint
william rowan hamilton
problema del
good solutions
simulated annealing
printed circuit board
computational complexity
solver
ant colony optimization
shortest path
endpoints
Search external links cited by footnotes on Wikipedia page Travelling salesman problem:
|
|