Traveling salesman problem / / edited by Federico Greco.
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the...
Saved in:
TeilnehmendeR: | |
---|---|
Place / Publishing House: | Rijeka, Croatia : : InTech,, [2008] ©2008 |
Year of Publication: | 2008 |
Language: | English |
Physical Description: | 1 online resource (212 pages) :; illustrations |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993547426504498 |
---|---|
ctrlnum |
(CKB)3230000000077144 (NjHacI)993230000000077144 (oapen)https://directory.doabooks.org/handle/20.500.12854/64676 (EXLCZ)993230000000077144 |
collection |
bib_alma |
record_format |
marc |
spelling |
Greco, Federico edt Traveling salesman problem / edited by Federico Greco. IntechOpen 2008 Rijeka, Croatia : InTech, [2008] ©2008 1 online resource (212 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Description based on: online resource; title from PDF information screen (InTech, viewed October 10, 2022). The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance. English Traveling-salesman problem. Computer modelling & simulation 953-7619-10-9 Greco, Federico, editor. |
language |
English |
format |
eBook |
author2 |
Greco, Federico, |
author_facet |
Greco, Federico, |
author2_variant |
f g fg f g fg |
author2_role |
TeilnehmendeR |
title |
Traveling salesman problem / |
spellingShingle |
Traveling salesman problem / |
title_full |
Traveling salesman problem / edited by Federico Greco. |
title_fullStr |
Traveling salesman problem / edited by Federico Greco. |
title_full_unstemmed |
Traveling salesman problem / edited by Federico Greco. |
title_auth |
Traveling salesman problem / |
title_new |
Traveling salesman problem / |
title_sort |
traveling salesman problem / |
publisher |
IntechOpen InTech, |
publishDate |
2008 |
physical |
1 online resource (212 pages) : illustrations |
isbn |
953-51-5750-7 953-7619-10-9 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA402 |
callnumber-sort |
QA 3402.5 T738 42008 |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
511 - General principles of mathematics |
dewey-full |
511.5 |
dewey-sort |
3511.5 |
dewey-raw |
511.5 |
dewey-search |
511.5 |
work_keys_str_mv |
AT grecofederico travelingsalesmanproblem |
status_str |
n |
ids_txt_mv |
(CKB)3230000000077144 (NjHacI)993230000000077144 (oapen)https://directory.doabooks.org/handle/20.500.12854/64676 (EXLCZ)993230000000077144 |
carrierType_str_mv |
cr |
is_hierarchy_title |
Traveling salesman problem / |
author2_original_writing_str_mv |
noLinkedField |
_version_ |
1796649024619544576 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00960nam a2200289 i 4500</leader><controlfield tag="001">993547426504498</controlfield><controlfield tag="005">20221011011621.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">221011s2008 ci a o 000 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">953-51-5750-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)3230000000077144</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)993230000000077144</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/64676</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)993230000000077144</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="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA402.5</subfield><subfield code="b">.T738 2008</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Greco, Federico</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Traveling salesman problem /</subfield><subfield code="c">edited by Federico Greco.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">IntechOpen</subfield><subfield code="c">2008</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rijeka, Croatia :</subfield><subfield code="b">InTech,</subfield><subfield code="c">[2008]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (212 pages) :</subfield><subfield code="b">illustrations</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: online resource; title from PDF information screen (InTech, viewed October 10, 2022).</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Traveling-salesman problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computer modelling & simulation</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">953-7619-10-9</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Greco, Federico,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-02-22 19:44:33 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2012-12-09 08:17:33 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=5338570470004498&Force_direct=true</subfield><subfield code="Z">5338570470004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338570470004498</subfield></datafield></record></collection> |