Timeline for Constructing optimal Hamilton cycles from optimal Hamilton paths
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2023 at 9:24 | history | edited | Jukka Kohonen |
+ top level tag
|
|
| Oct 8, 2023 at 6:43 | vote | accept | Manfred Weis | ||
| Oct 7, 2023 at 17:59 | answer | added | Jukka Kohonen | timeline score: 2 | |
| Oct 7, 2023 at 15:41 | comment | added | Jukka Kohonen | Any kind of exchanges of two edges $ab$ and $cd$ into $ad$ and $bc$? (If you allow "any" exchange of any number of edges to any other edges, surely you find the optimum in one such exchange.) Also, between two vertices, can the edges in opposite directions have different weights? | |
| Oct 7, 2023 at 14:08 | comment | added | Manfred Weis | @JukkaKohonen any kind of exchanges are allowed; I wonder however whether chained 2-opt moves suffice for finding the optimal tour... | |
| Oct 7, 2023 at 7:51 | comment | added | Jukka Kohonen | What kind of edge exchanges are allowed? | |
| Sep 17, 2023 at 11:30 | history | asked | Manfred Weis | CC BY-SA 4.0 |