✳flâneur — a map of the web's best reading
The Travelling Salesman Problem — an implementation in Python | by Marios Kokmotos | Medium
medium.com · 1,889 words · saved by 1 readers
You find yourself in Central Europe in the 1800’s. You need to make a living by selling your goods (let’s say ceramic and metallic…
The Travelling Salesman Problem — an implementation in Python Marios Kokmotos 8 min read · Feb 28, 2023 -- 2 Listen Share Press enter or click to view image in full size Photo by Andrew Stutesman on Unsplash You find yourself in Central Europe in the 1800’s. You need to make a living by selling your goods (let’s say ceramic and metallic household goods). After having a good night’s rest at the ‘Feisty Goat’ guest house, you feed your horses and pack your things while planning your route. You need to travel to 12 cities through the summer in order to sell your goods and maximise your profit. So
Explore this link on the map →saved by
related reading
- Travelling salesman problem - Wikipediaen.wikipedia.org
- 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
- Greedy algorithm - Wikipediaen.wikipedia.org
- Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazinequantamagazine.org
- Chinese postman problem - Wikipediaen.wikipedia.org
- Hamiltonian path problem - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Many Hard Leetcode Problems are Easy Constraint Problems • Buttondownbuttondown.com
- P versus NP problem - Wikipediaen.wikipedia.org
- Google Maps–it’s just one big graph : Networks Course blog for INFO 2040/CS 2850/Econ 2040/SOC 2090blogs.cornell.edu