Novel Trends in the Traveling Salesman Problem / / Donald Davendra, Magdalena Bialic-Davendra.
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:
| VerfasserIn: | |
|---|---|
| TeilnehmendeR: | |
| Place / Publishing House: | London, United Kingdom : : IntechOpen,, 2020. |
| Year of Publication: | 2020 |
| Language: | English |
| Physical Description: | 1 online resource (100 pages) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
993603429404498 |
|---|---|
| ctrlnum |
(CKB)5400000000044646 (NjHacI)995400000000044646 (EXLCZ)995400000000044646 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Davendra, Donald, author. Novel Trends in the Traveling Salesman Problem / Donald Davendra, Magdalena Bialic-Davendra. London, United Kingdom : IntechOpen, 2020. 1 online resource (100 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Description based on publisher supplied metadata and other sources. 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. English. Discrete mathematics. 1-83962-455-8 Bialic-Davendra, Magdalena, author. |
| language |
English |
| format |
eBook |
| author |
Davendra, Donald, Bialic-Davendra, Magdalena, |
| spellingShingle |
Davendra, Donald, Bialic-Davendra, Magdalena, Novel Trends in the Traveling Salesman Problem / |
| author_facet |
Davendra, Donald, Bialic-Davendra, Magdalena, Bialic-Davendra, Magdalena, |
| author_variant |
d d dd m b d mbd |
| author_role |
VerfasserIn VerfasserIn |
| author2 |
Bialic-Davendra, Magdalena, |
| author2_role |
TeilnehmendeR |
| author_sort |
Davendra, Donald, |
| title |
Novel Trends in the Traveling Salesman Problem / |
| title_full |
Novel Trends in the Traveling Salesman Problem / Donald Davendra, Magdalena Bialic-Davendra. |
| title_fullStr |
Novel Trends in the Traveling Salesman Problem / Donald Davendra, Magdalena Bialic-Davendra. |
| title_full_unstemmed |
Novel Trends in the Traveling Salesman Problem / Donald Davendra, Magdalena Bialic-Davendra. |
| title_auth |
Novel Trends in the Traveling Salesman Problem / |
| title_new |
Novel Trends in the Traveling Salesman Problem / |
| title_sort |
novel trends in the traveling salesman problem / |
| publisher |
IntechOpen, |
| publishDate |
2020 |
| physical |
1 online resource (100 pages) |
| isbn |
1-83962-455-8 |
| callnumber-first |
Q - Science |
| callnumber-subject |
QA - Mathematics |
| callnumber-label |
QA297 |
| callnumber-sort |
QA 3297.4 D384 42020 |
| illustrated |
Not Illustrated |
| dewey-hundreds |
000 - Computer science, information & general works |
| dewey-tens |
000 - Computer science, knowledge & systems |
| dewey-ones |
004 - Data processing & computer science |
| dewey-full |
004.0151 |
| dewey-sort |
14.0151 |
| dewey-raw |
004.0151 |
| dewey-search |
004.0151 |
| work_keys_str_mv |
AT davendradonald noveltrendsinthetravelingsalesmanproblem AT bialicdavendramagdalena noveltrendsinthetravelingsalesmanproblem |
| status_str |
n |
| ids_txt_mv |
(CKB)5400000000044646 (NjHacI)995400000000044646 (EXLCZ)995400000000044646 |
| carrierType_str_mv |
cr |
| is_hierarchy_title |
Novel Trends in the Traveling Salesman Problem / |
| author2_original_writing_str_mv |
noLinkedField |
| _version_ |
1796653209529352192 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01814nam a2200313 i 4500</leader><controlfield tag="001">993603429404498</controlfield><controlfield tag="005">20230626091206.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">230626s2020 enk o 000 0 eng d</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.5772/intechopen.78197</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5400000000044646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)995400000000044646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995400000000044646</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA297.4</subfield><subfield code="b">.D384 2020</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davendra, Donald,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Novel Trends in the Traveling Salesman Problem /</subfield><subfield code="c">Donald Davendra, Magdalena Bialic-Davendra.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London, United Kingdom :</subfield><subfield code="b">IntechOpen,</subfield><subfield code="c">2020.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (100 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Discrete mathematics.</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">1-83962-455-8</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bialic-Davendra, Magdalena,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-07-06 03:33:57 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-04-04 09:22:53 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338076520004498&Force_direct=true</subfield><subfield code="Z">5338076520004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338076520004498</subfield></datafield></record></collection> |