000			02070naaaa2200337uu 4500
001			https://directory.doabooks.org/handle/20.500.12854/67781
005			20220220032256.0
020			_aintechopen.78197
020			_a9781839624544
020			_a9781839624537
020			_a9781839624551
024	7		_a10.5772/intechopen.78197 _cdoi
041	0		_aEnglish
042			_adc
072		7	_aPBD _2bicssc
100	1		_aDavendra, Donald _4edt
700	1		_aBialic-Davendra, Magdalena _4edt
700	1		_aDavendra, Donald _4oth
700	1		_aBialic-Davendra, Magdalena _4oth
245	1	0	_aNovel Trends in the Traveling Salesman Problem
260			_bIntechOpen _c2020
300			_a1 electronic resource (100 p.)
506	0		_aOpen Access _2star _fUnrestricted online access
520			_aThe 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			_aCreative Commons _fhttps://creativecommons.org/licenses/by/3.0/ _2cc _4https://creativecommons.org/licenses/by/3.0/
546			_aEnglish
650		7	_aDiscrete mathematics _2bicssc
653			_aDiscrete mathematics
856	4	0	_awww.oapen.org _uhttps://mts.intechopen.com/storage/books/8241/authors_book/authors_book.pdf _70 _zDOAB: download the publication
856	4	0	_awww.oapen.org _uhttps://directory.doabooks.org/handle/20.500.12854/67781 _70 _zDOAB: description of the publication
999			_c62103 _d62103