Timeline for Traveling Salesman: Optimization over cities, not distance
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2023 at 20:28 | comment | added | RobPratt | Search for orienteering problem | |
| Feb 8, 2023 at 19:09 | history | edited | YCor |
edited tags
|
|
| Feb 8, 2023 at 18:37 | comment | added | MathManiac5772 | @JukkaKohonen I see, so I would just increase $k$ until the minimum length surpasses the prescribed threshold on the distance. Thanks! | |
| Feb 8, 2023 at 18:34 | comment | added | Jukka Kohonen | Seems to be a dual formulation of the "subset-tour problem", where you minimize the length, subject to the requirement of visiting $k$ cities. | |
| Feb 8, 2023 at 18:05 | history | asked | MathManiac5772 | CC BY-SA 4.0 |