traveling salesman problem
The traveling salesman problem is a mathematical problem in which a salesman needs to plan a route to visit a given set of cities, each only once, and return to the starting point, with the shortest possible distance traveled.
Requires login.
Related Concepts (2)
Similar Concepts
- algorithms
- breadth-first search
- creative problem solving
- dijkstra's algorithm
- floyd-warshall algorithm
- graph shortest path algorithms
- knapsack problem
- mathematical programming
- optimization algorithms
- optimization problems
- principal-agent problem
- problem solving
- robot path planning
- robotics algorithms
- stochastic optimization