Novel Trends in the Traveling Salesman Problem (Record no. 62103)

MARC details
000 -LEADER
fixed length control field 02070naaaa2200337uu 4500
001 - CONTROL NUMBER
control field https://directory.doabooks.org/handle/20.500.12854/67781
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220220032256.0
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number intechopen.78197
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781839624544
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781839624537
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781839624551
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.5772/intechopen.78197
Terms of availability doi
041 0# - LANGUAGE CODE
Language code of text/sound track or separate title English
042 ## - AUTHENTICATION CODE
Authentication code dc
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Davendra, Donald
Relationship edt
245 10 - TITLE STATEMENT
Title Novel Trends in the Traveling Salesman Problem
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Name of publisher, distributor, etc. IntechOpen
Date of publication, distribution, etc. 2020
300 ## - PHYSICAL DESCRIPTION
Extent 1 electronic resource (100 p.)
506 0# - RESTRICTIONS ON ACCESS NOTE
Terms governing access Open Access
Source of term star
Standardized terminology for access restriction Unrestricted online access
520 ## - SUMMARY, ETC.
Summary, etc. 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 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE
Terms governing use and reproduction Creative Commons
Use and reproduction rights https://creativecommons.org/licenses/by/3.0/
Source of term cc
-- https://creativecommons.org/licenses/by/3.0/
546 ## - LANGUAGE NOTE
Language note English
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics
Source of heading or term bicssc
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term Discrete mathematics
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Bialic-Davendra, Magdalena
Relationship edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Davendra, Donald
Relationship oth
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Bialic-Davendra, Magdalena
Relationship oth
856 40 - ELECTRONIC LOCATION AND ACCESS
Host name www.oapen.org
Uniform Resource Identifier <a href="https://mts.intechopen.com/storage/books/8241/authors_book/authors_book.pdf">https://mts.intechopen.com/storage/books/8241/authors_book/authors_book.pdf</a>
Access status 0
Public note DOAB: download the publication
856 40 - ELECTRONIC LOCATION AND ACCESS
Host name www.oapen.org
Uniform Resource Identifier <a href="https://directory.doabooks.org/handle/20.500.12854/67781">https://directory.doabooks.org/handle/20.500.12854/67781</a>
Access status 0
Public note DOAB: description of the publication

No items available.