Cargando…
The traveling salesman problem and its variations /
This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms.
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Dordrecht ; Boston :
Kluwer Academic Publishers,
©2002.
|
| Colección: | Combinatorial optimization ;
v. 12. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocm55085594 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 040506s2002 ne a ob 001 0 eng d | ||
| 010 | |z 2002072493 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d YDXCP |d OCLCG |d OCLCQ |d TUU |d OCLCQ |d REDDC |d BAKER |d DKDLA |d ADU |d E7B |d OCLCQ |d OCLCF |d OCLCO |d OCLCQ |d EBLCP |d DEBSZ |d OCLCQ |d AZK |d COCUF |d MOR |d PIFBR |d ZCU |d OTZ |d MERUC |d OCLCQ |d WY@ |d U3W |d LUE |d STF |d WRM |d NRAMU |d ICG |d INT |d VT2 |d TOF |d OCLCQ |d AU@ |d WYU |d CANPU |d TKN |d OCLCQ |d DKC |d COO |d OCLCQ |d CNTRU |d UKCRE |d OCLCO |d QGK |d OCLCQ |d OCLCO |d OCLCQ |d INARC |d OCLCL | ||
| 019 | |a 70745681 |a 474261431 |a 614647305 |a 646723352 |a 756524579 |a 855968951 |a 888761835 |a 961671751 |a 962597118 |a 988433423 |a 991951383 |a 992010666 |a 995026120 |a 1037738214 |a 1038597859 |a 1045502436 |a 1055377280 |a 1058016379 |a 1066536893 |a 1078826113 |a 1078844375 |a 1081234874 |a 1097322164 |a 1153562842 |a 1162799703 |a 1228554538 |a 1259210647 |a 1412771323 | ||
| 020 | |a 0306482134 |q (electronic bk.) | ||
| 020 | |a 9780306482137 |q (electronic bk.) | ||
| 020 | |a 1402006640 |q (HB ; |q alk. paper) | ||
| 020 | |a 9781402006647 |q (HB ; |q alk. paper) | ||
| 024 | 7 | |a 10.1007/b101971 |2 doi | |
| 029 | 1 | |a AU@ |b 000053246468 | |
| 029 | 1 | |a AU@ |b 000066278779 | |
| 029 | 1 | |a DEBBG |b BV044078095 | |
| 029 | 1 | |a DEBSZ |b 442808852 | |
| 029 | 1 | |a DKDLA |b 820120-katalog:999896707505765 | |
| 029 | 1 | |a NZ1 |b 12007865 | |
| 035 | |a (OCoLC)55085594 |z (OCoLC)70745681 |z (OCoLC)474261431 |z (OCoLC)614647305 |z (OCoLC)646723352 |z (OCoLC)756524579 |z (OCoLC)855968951 |z (OCoLC)888761835 |z (OCoLC)961671751 |z (OCoLC)962597118 |z (OCoLC)988433423 |z (OCoLC)991951383 |z (OCoLC)992010666 |z (OCoLC)995026120 |z (OCoLC)1037738214 |z (OCoLC)1038597859 |z (OCoLC)1045502436 |z (OCoLC)1055377280 |z (OCoLC)1058016379 |z (OCoLC)1066536893 |z (OCoLC)1078826113 |z (OCoLC)1078844375 |z (OCoLC)1081234874 |z (OCoLC)1097322164 |z (OCoLC)1153562842 |z (OCoLC)1162799703 |z (OCoLC)1228554538 |z (OCoLC)1259210647 |z (OCoLC)1412771323 | ||
| 050 | 4 | |a QA164 |b .T733 2002eb | |
| 072 | 7 | |a MAT |x 036000 |2 bisacsh | |
| 072 | 7 | |a PBD |2 bicssc | |
| 072 | 7 | |a PBD |2 thema | |
| 072 | 7 | |a UYAM |2 thema | |
| 082 | 0 | 4 | |a 511/.6 |2 22 |
| 049 | |a UAMI | ||
| 245 | 0 | 4 | |a The traveling salesman problem and its variations / |c edited by Gregory Gutin and Abraham P. Punnen. |
| 260 | |a Dordrecht ; |a Boston : |b Kluwer Academic Publishers, |c ©2002. | ||
| 300 | |a 1 online resource (xviii, 830 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 | ||
| 347 | |a data file | ||
| 490 | 1 | |a Combinatorial optimization ; |v v. 12 | |
| 504 | |a Includes bibliographical references (pages 761-806) and index. | ||
| 505 | 0 | |a The Traveling salesman problem: applications, formulations, and variations / Abraham P. Punnen -- Polyhedral theory and branch-and-cut algorithms for the symmetric TSP / Denis Naddef -- Polyhedral theory for the asymmetric traveling salesman problem / Egon Balas, Matteo Fischetti -- Exact methods for the asymmetric traveling salesman problem / Matteo Fischetti, Andrea Lodi, Paolo Toth -- Approximation algorithms for geometric TSP / Sanjeev Arora -- Exponential neighborhoods and domination analysis for the TSP / Gregory Gutin, Anders Yeo, Alexei Zverovitch -- Probabilistic analysis of the TSP / A.M. Frieze, J.E. Yukich -- Local search and metaheuristics / César Rego, Fred Flover -- Experimental analysis of heuristics for the STSP / David S. Johnson, Lyle A. McGeoch -- Experimental analysis of heuristics for the ATSP / David S. Johnson [and others] -- Polynomially solvable cases of the TSP / Santosh N. Kabadi -- The maximum TSP / Alexander Barvinok, Edward Kh. Gimadi, Anatoliy I. Serdyukov -- The generalized traveling salesman and orienteering problems / Matteo Fischetti, Juan-JoséSlazar-González, Paolo Toth -- The prize collecting Traveling salesman problem and its applications / Egon Balas -- The bottleneck TSP / Santosh N. Kabadi, Abraham P. Punnen -- TSP software / Andrea Lodi, Abraham P. Punnen. | |
| 588 | 0 | |a Print version record. | |
| 520 | |a This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Traveling salesman problem. | |
| 650 | 0 | |a Combinatorial optimization. | |
| 650 | 6 | |a Problèmes de tournées. | |
| 650 | 6 | |a Optimisation combinatoire. | |
| 650 | 7 | |a MATHEMATICS |x Combinatorics. |2 bisacsh | |
| 650 | 7 | |a Combinatorial optimization |2 fast | |
| 650 | 7 | |a Traveling salesman problem |2 fast | |
| 700 | 1 | |a Gutin, Gregory, |d 1957- |1 https://id.oclc.org/worldcat/entity/E39PBJfCwy8pPTD4yqdDqdY9Dq | |
| 700 | 1 | |a Punnen, Abraham P. | |
| 758 | |i has work: |a The traveling salesman problem and its variations (Text) |1 https://id.oclc.org/worldcat/entity/E39PCG4gtDyb6fXtFVC844gBj3 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |t Traveling salesman problem and its variations. |d Dordrecht ; Boston : Kluwer Academic Publishers, ©2002 |z 1402006640 |w (DLC) 2002072493 |w (OCoLC)50004076 |
| 830 | 0 | |a Combinatorial optimization ; |v v. 12. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=197850 |z Texto completo |
| 938 | |a Baker & Taylor |b BKTY |c 159.00 |d 159.00 |i 1402006640 |n 0004008156 |s active | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL197850 | ||
| 938 | |a EBSCOhost |b EBSC |n 99507 | ||
| 938 | |a YBP Library Services |b YANK |n 100420587 | ||
| 938 | |a Internet Archive |b INAR |n isbn_9781402006647 | ||
| 994 | |a 92 |b IZTAP | ||