Parallelized solution to the asymmetric travelling salesman problem using central processing unit acceleration
Travelling salesman problem is a well researched problem in computer science and has many practical applications. It is classified as a NP-hard problem as its exact solution can only be obtained in exponential time unless P = NP. There are different variants of the travelling salesman problem (TSP)...
Saved in:
Main Authors: | Arya, Akschat (Author), Perumal, Boominathan (Author), Krishnan, Santhi (Author) |
---|---|
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2022-03-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
by: Rajesh Matai, et al.
Published: (2010) -
Traveling Salesman Problem
Published: (2008) -
Novel Trends in the Traveling Salesman Problem
Published: (2020) -
Traveling Salesman Problem : Theory and Applications
Published: (2010) -
Introductory Chapter: Traveling Salesman Problem - An Overview
by: Davendra, Donald, et al.
Published: (2020)