Novel Trends in the Traveling Salesman Problem

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Magdalena Bialic-Davendra, Donald Davendra

Ngôn ngữ: eng

ISBN-13: 978-1839624551

Ký hiệu phân loại:

Thông tin xuất bản: London, UK : IntechOpen, 2020

Mô tả vật lý: 1 electronic resource (100 p.)

Bộ sưu tập: Tài liệu truy cập mở

ID: 207569

The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP problem and its application base now extends into scheduling, manufacturing, routing, and logistics. With the advent of high-performance computing and advanced meta-heuristics such as GPU programming and swarm-based algorithms, the TSP problem is positioned firmly as the go-to problem for the development of the next generation of high-performance intelligent heuristics. This book looks to leverage some of these new paradigms for both students and researchers in this field.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 71010608 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH