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 |
- 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.