New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

TSP #251

Closed

hitonanode opened this issue Nov 8, 2022 · 2 comments

Owner

hitonanode commented Nov 8, 2022 •

edited

Loading

問題例
厳密解
- Held–Karp algorithm $O(n 2^n)$
Symmetric TSP の有名ヒューリスティクス
- 2-opt
- Or-opt
- 3-opt
- Lin–Kernighan heuristic
  - Lin–Kernighan–Helsgaun
    - http://webhotel4.ruc.dk/~keld/research/LKH/LKH-1.3/DOC/LKH_REPORT.pdf が非常に詳しい
やってみるかも
- 割当近傍 http://dopal.cs.uec.ac.jp/okamotoy/lect/2013/localsearch/handout09.pdf
Asymmetric でも symmetric に帰着できる https://en.wikipedia.org/wiki/Travelling_salesman_problem#Asymmetric
下界
- Held–Karp lower bound
その他リンク
- https://future-architect.github.io/articles/20211201a/

Owner Author

hitonanode commented Jan 27, 2023

まあまあ https://atcoder.jp/contests/tessoku-book/submissions/38355569

hitonanode mentioned this issue

TSP (2-opt, 3-opt, double-bridge, Held-Karp lower bound) #274

Merged

Owner Author

hitonanode commented Jan 3, 2025

当面やらない...

hitonanode closed this as completed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment