Traveling Salesman Problem
- Published
- IntechOpen 2008
- Physical Description
- 1 online resource (212 p.)
Access Online
- directory.doabooks.org , Open Access: DOAB: description of the publication
- mts.intechopen.com , Open Access: DOAB, download the publication
- Language Note
- English
- Restrictions on Access
- Open Access Unrestricted online access
- Summary
- 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.
- Subject(s)
- Other Subject(s)
- ISBN
- 66
9789535157502
9789537619107 - Collection
- DOAB Library.
- Terms of Use and Reproduction
- Creative Commons https://creativecommons.org/licenses/by-nc-sa/3.0/
View MARC record | catkey: 33857680