Travelling salesman problem
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.
Travelling salesman problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia NP-hard problem in combinatorial optimization The travelling salesman problem seeks to find the shortest possible loop that connects every red dot. Solution of the above problem In the theory of computational complexity , the travelling salesman problem ( TSP ) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatoria
Explore this link on the map →related reading
- The Travelling Salesman Problem — an implementation in Python | by Marios Kokmotos | Mediummedium.com
- Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that’s stood for nearly half a centurytheconversation.com
- Computing the optimal road trip across the U.S. | Dr. Randal S. Olsonrandalolson.com
- Knapsack problem - Wikipediaen.wikipedia.org
- Chinese postman problem - Wikipediaen.wikipedia.org
- Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazinequantamagazine.org
- P versus NP problem - Wikipediaen.wikipedia.org
- Greedy algorithm - Wikipediaen.wikipedia.org
- Hamiltonian path problem - Wikipediaen.wikipedia.org
- NP-completeness - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Minimum-weight triangulation - Wikipediaen.wikipedia.org