Traveling Salesman Problem
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:
| Other Authors: | |
|---|---|
| Format: | Book Chapter |
| Published: |
IntechOpen
2008
|
| Subjects: | |
| Online Access: | Get Fullteks DOAB: description of the publication |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02164naaaa2200289uu 4500 | ||
|---|---|---|---|
| 001 | doab_20_500_12854_64676 | ||
| 005 | 20210420 | ||
| 020 | |a 66 | ||
| 020 | |a 9789537619107 | ||
| 020 | |a 9789535157502 | ||
| 024 | 7 | |a 10.5772/66 |c doi | |
| 041 | 0 | |a English | |
| 042 | |a dc | ||
| 072 | 7 | |a UYM |2 bicssc | |
| 100 | 1 | |a Greco, Federico |4 edt | |
| 700 | 1 | |a Greco, Federico |4 oth | |
| 245 | 1 | 0 | |a Traveling Salesman Problem |
| 260 | |b IntechOpen |c 2008 | ||
| 300 | |a 1 electronic resource (212 p.) | ||
| 506 | 0 | |a Open Access |2 star |f Unrestricted online access | |
| 520 | |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. | ||
| 540 | |a Creative Commons |f https://creativecommons.org/licenses/by-nc-sa/3.0/ |2 cc |4 https://creativecommons.org/licenses/by-nc-sa/3.0/ | ||
| 546 | |a English | ||
| 650 | 7 | |a Computer modelling & simulation |2 bicssc | |
| 653 | |a Computer modelling & simulation | ||
| 856 | 4 | 0 | |a www.oapen.org |u https://mts.intechopen.com/storage/books/3769/authors_book/authors_book.pdf |7 0 |z Get Fullteks |
| 856 | 4 | 0 | |a www.oapen.org |u https://directory.doabooks.org/handle/20.500.12854/64676 |7 0 |z DOAB: description of the publication |