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!
|
LEADER | 00960nam a2200289 i 4500 | ||
---|---|---|---|
001 | 993547426504498 | ||
005 | 20221011011621.0 | ||
006 | m o d | ||
007 | cr ||||||||||| | ||
008 | 221011s2008 ci a o 000 0 eng d | ||
020 | |a 953-51-5750-7 | ||
035 | |a (CKB)3230000000077144 | ||
035 | |a (NjHacI)993230000000077144 | ||
035 | |a (oapen)https://directory.doabooks.org/handle/20.500.12854/64676 | ||
035 | |a (EXLCZ)993230000000077144 | ||
040 | |a NjHacI |b eng |e rda |c NjHacl | ||
041 | 0 | |a eng | |
050 | 4 | |a QA402.5 |b .T738 2008 | |
082 | 0 | 4 | |a 511.5 |2 23 |
100 | 1 | |a Greco, Federico |4 edt | |
245 | 0 | 0 | |a Traveling salesman problem / |c edited by Federico Greco. |
260 | |b IntechOpen |c 2008 | ||
264 | 1 | |a Rijeka, Croatia : |b InTech, |c [2008] | |
264 | 4 | |c ©2008 | |
300 | |a 1 online resource (212 pages) : |b illustrations | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
588 | |a Description based on: online resource; title from PDF information screen (InTech, viewed October 10, 2022). | ||
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. | ||
546 | |a English | ||
650 | 0 | |a Traveling-salesman problem. | |
653 | |a Computer modelling & simulation | ||
776 | |z 953-7619-10-9 | ||
700 | 1 | |a Greco, Federico, |e editor. | |
906 | |a BOOK | ||
ADM | |b 2023-02-22 19:44:33 Europe/Vienna |f system |c marc21 |a 2012-12-09 08:17:33 Europe/Vienna |g false | ||
AVE | |i DOAB Directory of Open Access Books |P DOAB Directory of Open Access Books |x https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338570470004498&Force_direct=true |Z 5338570470004498 |b Available |8 5338570470004498 |