Timeline for Adapting Held–Karp algorithm to visit groups of vertices
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2023 at 15:32 | comment | added | Manfred Weis | There is no need to feel stupid; similar things happen(ed) to me, but it had the positive effect that I found solutions myself, occasionally better ones. | |
| Jul 19, 2023 at 15:29 | comment | added | Tomi | This is the solution. I feel stupid for not finding this. Thank you! | |
| Jul 19, 2023 at 15:23 | comment | added | Manfred Weis | you can check the 1989 paper by JOHN R. CURRENT and DAVID A. SCHILLING: "Covering Traveling Salesman" jstor.org/stable/25768381 Not sure if your problem is different; would be interesting to know in which respect. | |
| S Jul 19, 2023 at 11:13 | review | First questions | |||
| Jul 19, 2023 at 11:15 | |||||
| S Jul 19, 2023 at 11:13 | history | asked | Tomi | CC BY-SA 4.0 |