@article{oai:miyazaki-u.repo.nii.ac.jp:00002917,
 author = {吉原, 郁夫 and Yoshihara, Ikuo and 大西, 亜実 and 黒田, 正文 and 山森, 一人 and Yamamori, Kunihito and 相川, 勝 and Aikawa, Masaru and Oishi, Ami and Kuroda, Masafumi},
 journal = {宮崎大学工学部紀要, Memoirs of Faculty of Engineering, University of Miyazaki},
 month = {Sep},
 note = {Lin-Kernighan (LK) algorithm has been widely used to solve Traveling Salesman Problems (TSP). The LK method searches for the optimal solution by changing cities in a tour in the surrounding regions one after another. The search region is limited by the number of candidate cities to be changed, e.g. 10 or 20. Our basic idea is to limit the number of candidate cities to reduce CPU time according to pre-executions. Here, pre-executions are to solve small size TSPs whose cities are partly chosen from the original TSP and to collect the edges appeared in the solutions of the small problems.},
 pages = {277--282},
 title = {リン・カーニハン法によるTSP求解の高速化},
 volume = {38},
 year = {2009},
 yomi = {ヨシハラ, イクオ and オオニシ, アミ and クロダ, マサフミ and ヤマモリ, クニヒト and アイカワ, マサル}
}