Nantilus
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,...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | The traveling salesman problem and its variations / Gregory Gutin, Abraham P. Punnen |
| Publié : |
New York, NY :
Springer US
, 2007 Cham : Springer Nature |
| Collection : | Combinatorial optimization ; 12 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | 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 |
| Sujets : | |
| Documents associés : | Autre format:
The Traveling Salesman Problem and Its Variations Autre format: The Traveling Salesman Problem and Its Variations Autre format: The Traveling Salesman Problem and Its Variations |
| LEADER | 04810clm a2200709 4500 | ||
|---|---|---|---|
| 001 | PPN17545650X | ||
| 003 | http://www.sudoc.fr/17545650X | ||
| 005 | 20241001155400.0 | ||
| 010 | |a 978-0-306-48213-7 | ||
| 017 | 7 | 0 | |a 10.1007/b101971 |2 DOI |
| 035 | |a (OCoLC)868157603 | ||
| 035 | |a Springer978-0-306-48213-7 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/b101971 | ||
| 035 | |a Springer-11649-978-0-306-48213-7 | ||
| 100 | |a 20140115d2007 u u0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a US | ||
| 105 | |a a a 001yy | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a The traveling salesman problem and its variations |f Gregory Gutin, Abraham P. Punnen | |
| 214 | 0 | |a New York, NY |c Springer US | |
| 214 | 2 | |a Cham |c Springer Nature |d 2007 | |
| 225 | 2 | |a Combinatorial optimization |v 12 | |
| 330 | |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. | ||
| 359 | 1 | |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. | |
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |t Combinatorial optimization |v 12 | |
| 452 | | | |t The Traveling Salesman Problem and Its Variations |b Texte imprimé |y 9781402006647 | |
| 452 | | | |t The Traveling Salesman Problem and Its Variations |b Texte imprimé |y 9780387444598 | |
| 452 | | | |t The Traveling Salesman Problem and Its Variations |b Texte imprimé |y 9781475788068 | |
| 606 | |3 PPN028032179 |a Optimisation combinatoire |2 rameau | ||
| 606 | |3 PPN032661762 |a Problème du voyageur de commerce |2 rameau | ||
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Operation Research/Decision Theory | |
| 610 | 2 | |a Discrete Mathematics in Computer Science | |
| 610 | 2 | |a Optimization | |
| 610 | 2 | |a Algorithms | |
| 610 | 2 | |a Operations Research and Decision Theory | |
| 615 | |a @Mathematics and Statistics |n 11649; ZDB-2-SMA |2 Springer | ||
| 615 | |a @Mathematics and Statistics |n 11649 |2 Springer | ||
| 676 | |a 511.6 |v 21 | ||
| 680 | |a QA76.9.M35 | ||
| 700 | 1 | |a Gutin |b Gregory |4 340 | |
| 701 | 1 | |a Gutin |b G. |4 651 | |
| 701 | 1 | |a Punnen |b A.P. |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20240814 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20240603 |g AACR2 | |
| 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 441099901:830843620 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/b101971 | |
| 915 | |5 441099901:830843620 |b SPRING18-00001 | ||
| 930 | |5 441099901:830843620 |b 441099901 |j g | ||
| 991 | |5 441099901:830843620 |a Exemplaire créé en masse par ITEM le 30-09-2024 15:58 | ||
| 997 | |a NUM |b SPRING18-00001 |d NUMpivo |e EM |s d | ||
| 998 | |a 979043 | ||