最終更新日:2022/12/07
正解を見る
(computing theory) In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour.
編集履歴(0)
元となった辞書の項目
Lin-Kernighan heuristic
name