000 04347cam a2200817Mi 4500
001 ocn749265038
003 OCoLC
005 20220908100016.0
006 m o d
007 cr |n|---|||||
008 110905s2011 nju o 000 0 eng d
040 _aEBLCP
_beng
_epn
_cEBLCP
_dOCLCQ
_dIDEBK
_dN$T
_dOCLCQ
_dDEBSZ
_dJSTOR
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCLCF
_dOCLCQ
_dCOO
_dOCLCO
_dUIU
_dAGLDB
_dZCU
_dOCLCQ
_dMERUC
_dOCLCQ
_dJBG
_dUEJ
_dIOG
_dEZ9
_dVTS
_dICG
_dOCLCQ
_dLVT
_dSTF
_dDKC
_dOCLCQ
_dM8D
_dOCLCQ
_dK6U
_dOCLCQ
_dAJS
_dIEEEE
_dOCLCO
019 _a816861866
020 _a9781400841103
_q(electronic bk.)
020 _a1400841100
_q(electronic bk.)
020 _a0691129932
020 _a9780691129938
020 _a1283256118
020 _a9781283256117
024 7 _a10.1515/9781400841103
_2doi
029 1 _aAU@
_b000048838440
029 1 _aCHBIS
_b010896040
029 1 _aCHVBK
_b483384720
029 1 _aDEBBG
_bBV043031564
029 1 _aDEBBG
_bBV044157573
029 1 _aDEBSZ
_b379323060
029 1 _aDEBSZ
_b421532777
029 1 _aDEBSZ
_b423075616
029 1 _aGBVCP
_b1003677630
029 1 _aDKDLA
_b820120-katalog:999928158105765
035 _a(OCoLC)749265038
_z(OCoLC)816861866
037 _a22573/cttx1kn
_bJSTOR
037 _a9453454
_bIEEE
050 4 _aQA164 .T72 2011
072 7 _aMAT
_x013000
_2bisacsh
072 7 _aMAT003000
_2bisacsh
072 7 _aUYA
_2bicssc
082 0 4 _a511/.5
049 _aMAIN
100 1 _aApplegate, David L.
_963934
245 1 4 _aThe Traveling Salesman Problem :
_ba Computational Study.
260 _aPrinceton :
_bPrinceton University Press,
_c2011.
300 _a1 online resource (606 pages)
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aPrinceton Series in Applied Mathematics
520 _aThis book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho.
588 0 _aPrint version record.
505 0 0 _tFrontmatter --
_tContents --
_tPreface --
_tChapter 1. The Problem --
_tChapter 2. Applications --
_tChapter 3. Dantzig, Fulkerson, and Johnson --
_tChapter 4. History of TSP Computation --
_tChapter 5. LP Bounds and Cutting Planes --
_tChapter 6. Subtour Cuts and PQ-Trees --
_tChapter 7. Cuts from Blossoms and Blocks --
_tChapter 8. Combs from Consecutive Ones --
_tChapter 9. Combs from Dominoes --
_tChapter 10. Cut Metamorphoses --
_tChapter 11. Local Cuts --
_tChapter 12. Managing the Linear Programming Problems --
_tChapter 13. The Linear Programming Solver Chapter 14. Branching --
_tChapter 14. Branching --
_tChapter 15. Tour Finding --
_tChapter 16. Computation --
_tChapter 17. The Road Goes On --
_tBibliography --
_tIndex.
546 _aIn English.
590 _aIEEE
_bIEEE Xplore Princeton University Press eBooks Library
650 0 _aTraveling salesman problem.
_963935
650 6 _aProbl�emes de tourn�ees.
_963936
650 7 _aMATHEMATICS
_xGraphic Methods.
_2bisacsh
_963937
650 7 _aMATHEMATICS
_xApplied.
_2bisacsh
_95811
650 7 _aTraveling salesman problem.
_2fast
_0(OCoLC)fst01155795
_963935
655 0 _aElectronic books.
_93294
655 4 _aElectronic books.
_93294
700 1 _aBixby, Robert E.
_963938
700 1 _aChvatal, Vasek.
_963939
700 1 _aCook, William J.
_963940
776 0 8 _iPrint version:
_aApplegate, David L.
_tTraveling Salesman Problem : A Computational Study.
_dPrinceton : Princeton University Press, �2011
_z9780691129938
830 0 _aPrinceton series in applied mathematics.
_963941
856 4 0 _uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=9453454
938 _aEBL - Ebook Library
_bEBLB
_nEBL768550
938 _aEBSCOhost
_bEBSC
_n390512
938 _aProQuest MyiLibrary Digital eBook Collection
_bIDEB
_n325611
942 _cEBK
994 _a92
_bINTKS
999 _c81231
_d81231