Different methods for asymmetric komivoyager 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 and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. More at Wikipedia
Documentation is available at GithubPages
- Damian Brzoza - Portfolio
This project is licensed under the MIT License - see the LICENSE.md file for details