Cargando…
The Traveling Salesman Problem : a Computational Study.
This 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 rou...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press,
2011.
|
| Colección: | Princeton series in applied mathematics.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | JSTOR_ocn749265038 | ||
| 003 | OCoLC | ||
| 005 | 20231005004200.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 110905s2011 nju o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d IDEBK |d N$T |d OCLCQ |d DEBSZ |d JSTOR |d OCLCQ |d OCLCO |d OCLCQ |d OCLCF |d OCLCQ |d COO |d OCLCO |d UIU |d AGLDB |d ZCU |d OCLCQ |d MERUC |d OCLCQ |d JBG |d UEJ |d IOG |d EZ9 |d VTS |d ICG |d OCLCQ |d LVT |d STF |d DKC |d OCLCQ |d M8D |d OCLCQ |d K6U |d OCLCQ |d AJS |d IEEEE |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 816861866 | ||
| 020 | |a 9781400841103 |q (electronic bk.) | ||
| 020 | |a 1400841100 |q (electronic bk.) | ||
| 020 | |a 0691129932 | ||
| 020 | |a 9780691129938 | ||
| 020 | |a 1283256118 | ||
| 020 | |a 9781283256117 | ||
| 024 | 7 | |a 10.1515/9781400841103 |2 doi | |
| 029 | 1 | |a AU@ |b 000048838440 | |
| 029 | 1 | |a CHBIS |b 010896040 | |
| 029 | 1 | |a CHVBK |b 483384720 | |
| 029 | 1 | |a DEBBG |b BV043031564 | |
| 029 | 1 | |a DEBBG |b BV044157573 | |
| 029 | 1 | |a DEBSZ |b 379323060 | |
| 029 | 1 | |a DEBSZ |b 421532777 | |
| 029 | 1 | |a DEBSZ |b 423075616 | |
| 029 | 1 | |a GBVCP |b 1003677630 | |
| 029 | 1 | |a DKDLA |b 820120-katalog:999928158105765 | |
| 035 | |a (OCoLC)749265038 |z (OCoLC)816861866 | ||
| 037 | |a 22573/cttx1kn |b JSTOR | ||
| 037 | |a 9453454 |b IEEE | ||
| 050 | 4 | |a QA164 .T72 2011 | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 072 | 7 | |a MAT003000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 bicssc | |
| 082 | 0 | 4 | |a 511/.5 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Applegate, David L. | |
| 245 | 1 | 4 | |a The Traveling Salesman Problem : |b a Computational Study. |
| 260 | |a Princeton : |b Princeton University Press, |c 2011. | ||
| 300 | |a 1 online resource (606 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Princeton Series in Applied Mathematics | |
| 520 | |a This 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 | |a Print version record. | |
| 505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Preface -- |t Chapter 1. The Problem -- |t Chapter 2. Applications -- |t Chapter 3. Dantzig, Fulkerson, and Johnson -- |t Chapter 4. History of TSP Computation -- |t Chapter 5. LP Bounds and Cutting Planes -- |t Chapter 6. Subtour Cuts and PQ-Trees -- |t Chapter 7. Cuts from Blossoms and Blocks -- |t Chapter 8. Combs from Consecutive Ones -- |t Chapter 9. Combs from Dominoes -- |t Chapter 10. Cut Metamorphoses -- |t Chapter 11. Local Cuts -- |t Chapter 12. Managing the Linear Programming Problems -- |t Chapter 13. The Linear Programming Solver Chapter 14. Branching -- |t Chapter 14. Branching -- |t Chapter 15. Tour Finding -- |t Chapter 16. Computation -- |t Chapter 17. The Road Goes On -- |t Bibliography -- |t Index. |
| 546 | |a In English. | ||
| 590 | |a JSTOR |b Books at JSTOR Evidence Based Acquisitions | ||
| 590 | |a JSTOR |b Books at JSTOR All Purchased | ||
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 650 | 0 | |a Traveling salesman problem. | |
| 650 | 6 | |a Problèmes de tournées. | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a Traveling salesman problem |2 fast | |
| 700 | 1 | |a Bixby, Robert E. | |
| 700 | 1 | |a Chvatal, Vasek. | |
| 700 | 1 | |a Cook, William J. | |
| 776 | 0 | 8 | |i Print version: |a Applegate, David L. |t Traveling Salesman Problem : A Computational Study. |d Princeton : Princeton University Press, ©2011 |z 9780691129938 |
| 830 | 0 | |a Princeton series in applied mathematics. | |
| 856 | 4 | 0 | |u https://jstor.uam.elogim.com/stable/10.2307/j.ctt7s8xg |z Texto completo |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL768550 | ||
| 938 | |a EBSCOhost |b EBSC |n 390512 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 325611 | ||
| 994 | |a 92 |b IZTAP | ||