Timeline for Optimality of a "shopping" heuristic
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2023 at 15:17 | history | edited | Thibault Poiret | CC BY-SA 4.0 |
added 7 characters in body
|
| Aug 4, 2023 at 15:16 | comment | added | Manfred Weis | That information is sufficient for my purposes; I had observed that the strategy was better than the greedy heuristic for a certain combinatorial problem on geometric graphs in the euclidean plane; specifically turnining a Minimum Spanning Tree into a Hamilton path via a sequence of edge-exchanges | |
| Aug 4, 2023 at 15:11 | vote | accept | Manfred Weis | ||
| Aug 4, 2023 at 15:06 | history | edited | Thibault Poiret | CC BY-SA 4.0 |
added 265 characters in body
|
| Aug 4, 2023 at 15:00 | history | answered | Thibault Poiret | CC BY-SA 4.0 |