← Back to context Comment by stevefan1999 11 hours ago ...is this not a Travelling Salesman Problem? 2 comments stevefan1999 Reply hyperpape 11 hours ago Related, but not quite the same. The solution to this problem can have more than one loop, whereas TSP definitionally has only one. Not quite sure how that changes the difficulty or the tools that you’d use. stevefan1999 10 hours ago Because my instinct immediately went into simulated annealing or ant colony.Or I think my PTSD on advanced algorithm course kicked inEdit: looks like the closet reduction should be https://en.wikipedia.org/wiki/Ring_star_problem with bounded circuit length
hyperpape 11 hours ago Related, but not quite the same. The solution to this problem can have more than one loop, whereas TSP definitionally has only one. Not quite sure how that changes the difficulty or the tools that you’d use. stevefan1999 10 hours ago Because my instinct immediately went into simulated annealing or ant colony.Or I think my PTSD on advanced algorithm course kicked inEdit: looks like the closet reduction should be https://en.wikipedia.org/wiki/Ring_star_problem with bounded circuit length
stevefan1999 10 hours ago Because my instinct immediately went into simulated annealing or ant colony.Or I think my PTSD on advanced algorithm course kicked inEdit: looks like the closet reduction should be https://en.wikipedia.org/wiki/Ring_star_problem with bounded circuit length
Related, but not quite the same. The solution to this problem can have more than one loop, whereas TSP definitionally has only one. Not quite sure how that changes the difficulty or the tools that you’d use.
Because my instinct immediately went into simulated annealing or ant colony.
Or I think my PTSD on advanced algorithm course kicked in
Edit: looks like the closet reduction should be https://en.wikipedia.org/wiki/Ring_star_problem with bounded circuit length