Novel Trends in the Traveling Salesman Problem
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...
Saved in:
| Other Authors: | , |
|---|---|
| Format: | Electronic Book Chapter |
| Language: | English |
| Published: |
IntechOpen
2020
|
| Subjects: | |
| Online Access: | DOAB: download the publication DOAB: description of the publication |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000naaaa2200000uu 4500 | ||
|---|---|---|---|
| 001 | doab_20_500_12854_67781 | ||
| 005 | 20210420 | ||
| 003 | oapen | ||
| 006 | m o d | ||
| 007 | cr|mn|---annan | ||
| 008 | 20210420s2020 xx |||||o ||| 0|eng d | ||
| 020 | |a intechopen.78197 | ||
| 020 | |a 9781839624544 | ||
| 020 | |a 9781839624537 | ||
| 020 | |a 9781839624551 | ||
| 040 | |a oapen |c oapen | ||
| 024 | 7 | |a 10.5772/intechopen.78197 |c doi | |
| 041 | 0 | |a eng | |
| 042 | |a dc | ||
| 072 | 7 | |a PBD |2 bicssc | |
| 100 | 1 | |a Davendra, Donald |4 edt | |
| 700 | 1 | |a Bialic-Davendra, Magdalena |4 edt | |
| 700 | 1 | |a Davendra, Donald |4 oth | |
| 700 | 1 | |a Bialic-Davendra, Magdalena |4 oth | |
| 245 | 1 | 0 | |a Novel Trends in the Traveling Salesman Problem |
| 260 | |b IntechOpen |c 2020 | ||
| 300 | |a 1 electronic resource (100 p.) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 506 | 0 | |a Open Access |2 star |f Unrestricted online access | |
| 520 | |a 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. | ||
| 540 | |a Creative Commons |f https://creativecommons.org/licenses/by/3.0/ |2 cc |4 https://creativecommons.org/licenses/by/3.0/ | ||
| 546 | |a English | ||
| 650 | 7 | |a Discrete mathematics |2 bicssc | |
| 653 | |a Discrete mathematics | ||
| 856 | 4 | 0 | |a www.oapen.org |u https://mts.intechopen.com/storage/books/8241/authors_book/authors_book.pdf |7 0 |z DOAB: download the publication |
| 856 | 4 | 0 | |a www.oapen.org |u https://directory.doabooks.org/handle/20.500.12854/67781 |7 0 |z DOAB: description of the publication |