The traveling salesman problem and its variations
This volume, which contains chapters written by reputable researchers, provides the state of the art in 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, branch and bound,...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Daljnji autori: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
New York, NY :
Springer US
2007.
Cham : Springer Nature |
| Serija: | Combinatorial optimization
12 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The Traveling Salesman Problem and Its Variations, Texte imprimé, 9781402006647 • The traveling salesman problem and its variations, Gregory Gutin, Abraham P. Punnen, New York, Springer, 2007, 1 vol. (XVIII-830 p.), Combinatorial optimization, 1-4020-0664-0 • The Traveling Salesman Problem and Its Variations, Texte imprimé, 9781475788068 |
| LEADER | 03961nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 947289 | ||
| 008 | 140115s2007 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN17545650X | ||
| 020 | |a 9780306482137 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.6 | ||
| 100 | 1 | |a Gutin, Gregory. | |
| 245 | 1 | 0 | |a The traveling salesman problem and its variations |c Gregory Gutin, Abraham P. Punnen. |
| 260 | |a New York, NY : |b Springer US. | ||
| 260 | |a Cham : |b Springer Nature, |c 2007. | ||
| 490 | 1 | |a Combinatorial optimization |v 12 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a The Traveling Salesman Problem: Applications, Formulations and Variations -- Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP -- Polyhedral Theory for the Asymmetric Traveling Salesman Problem -- Exact Methods for the Asymmetric Traveling Salesman Problem -- Approximation Algorithms for Geometric TSP -- Exponential Neighborhoods and Domination Analysis for the TSP -- Probabilistic Analysis of the TSP -- Local Search and Metaheuristics -- Experimental Analysis of Heuristics for the STSP -- Experimental Analysis of Heuristics for the ATSP -- Polynomially Solvable Cases of the TSP -- The Maximum TSP -- The Generalized Traveling Salesman and Orienteering Problems -- The Prize Collecting Traveling Salesman Problem and its Applications -- The Bottleneck TSP -- TSP Software. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a This volume, which contains chapters written by reputable researchers, provides the state of the art in 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, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. Audience This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects. | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Problème du voyageur de commerce | ||
| 700 | 1 | |a Gutin, G. |4 pbd | |
| 700 | 1 | |a Punnen, A.P. |4 pbd | |
| 776 | 0 | |t The Traveling Salesman Problem and Its Variations |b Texte imprimé |z 9781402006647 | |
| 776 | 0 | |0 139593179 |t The traveling salesman problem and its variations |f Gregory Gutin, Abraham P. Punnen |c New York |n Springer |d 2007 |p 1 vol. (XVIII-830 p.) |s Combinatorial optimization |z 1-4020-0664-0 | |
| 776 | 0 | |t The Traveling Salesman Problem and Its Variations |b Texte imprimé |z 9781475788068 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b101971 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5B0JGJKH-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747874409 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b101971 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750886765 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b101971 |z Accès INSA CVL | |
| 997 | |0 947289 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||