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: | , , |
---|---|
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!
|
Internet
Get fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |