ScholarWorks@고려대학교

상세 보기

A parallel TSP(Traveling Salesman Problem) algorithm based on divide-and-conquer strategy

  • Kim, Dong Seung
제목
A parallel TSP(Traveling Salesman Problem) algorithm based on divide-and-conquer strategy
저자
Kim, Dong Seung
학회명
IOS Press

ScholarWorks@고려대학교

02841 서울특별시 성북구 안암로 145 Tel. 02-3290-2963

COPYRIGHT © 고려대학교 All Rights Reserved.

Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.

You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.