Traveling Salesman Problem
dc.contributor.editor | Greco, Federico | |
dc.date.accessioned | 2021-04-20T14:53:10Z | |
dc.date.available | 2021-04-20T14:53:10Z | |
dc.date.issued | 2008 | |
dc.identifier | ONIX_20210420_9789537619107_32 | |
dc.identifier.uri | https://directory.doabooks.org/handle/20.500.12854/64676 | |
dc.description.abstract | 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. | |
dc.language | English | |
dc.subject.classification | thema EDItEUR::U Computing and Information Technology::UY Computer science::UYM Computer modelling and simulation | en_US |
dc.subject.other | Computer modelling & simulation | |
dc.title | Traveling Salesman Problem | |
dc.type | book | |
oapen.identifier.doi | 10.5772/66 | |
oapen.relation.isPublishedBy | 78a36484-2c0c-47cb-ad67-2b9f5cd4a8f6 | |
oapen.relation.isbn | 9789537619107 | |
oapen.relation.isbn | 9789535157502 | |
oapen.imprint | IntechOpen | |
oapen.pages | 212 |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |