Cargando…

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Gutin, G. (Editor ), Punnen, A.P (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Combinatorial Optimization ; 12
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-0-306-48213-7
003 DE-He213
005 20220114133016.0
007 cr nn 008mamaa
008 100301s2007 xxu| s |||| 0|eng d
020 |a 9780306482137  |9 978-0-306-48213-7 
024 7 |a 10.1007/b101971  |2 doi 
050 4 |a QA76.9.M35 
050 4 |a QA297.4 
072 7 |a UYAM  |2 bicssc 
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
072 7 |a PBD  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 4 |a The Traveling Salesman Problem and Its Variations  |h [electronic resource] /  |c edited by G. Gutin, A.P. Punnen. 
250 |a 1st ed. 2007. 
264 1 |a New York, NY :  |b Springer US :  |b Imprint: Springer,  |c 2007. 
300 |a XVIII, 830 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Combinatorial Optimization ;  |v 12 
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. 
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 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Mathematical optimization. 
650 0 |a Operations research. 
650 0 |a Algorithms. 
650 1 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Optimization. 
650 2 4 |a Operations Research and Decision Theory. 
650 2 4 |a Algorithms. 
700 1 |a Gutin, G.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Punnen, A.P.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781402006647 
776 0 8 |i Printed edition:  |z 9781475788068 
776 0 8 |i Printed edition:  |z 9780387444598 
830 0 |a Combinatorial Optimization ;  |v 12 
856 4 0 |u https://doi.uam.elogim.com/10.1007/b101971  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)