12 views (last 30 days)

Show older comments

Christine Tobler
on 24 Mar 2021

Christine Tobler
on 25 Mar 2021

This could be used to solve the Traveling Salesman problem (not efficiently), but not for the variant your looking for.

Here I'm just going through all possible ways of visiting each node exactly once, and then taking the minimum of that large set of possibilities. But when nodes can be visited many times, there's no way to just write up all possible orders of visiting the nodes, there are infinitely many ways to do this.

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!