000 | 03608nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-0-306-48213-7 | ||
003 | DE-He213 | ||
005 | 20161121231121.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 xxu| s |||| 0|eng d | ||
020 |
_a9780306482137 _9978-0-306-48213-7 |
||
024 | 7 |
_a10.1007/b101971 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 4 |
_aThe Traveling Salesman Problem and Its Variations _h[electronic resource] / _cedited by Gregory Gutin, Abraham P. Punnen. |
264 | 1 |
_aBoston, MA : _bSpringer US : _bImprint: Springer, _c2007. |
|
300 |
_aXVIII, 830 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aCombinatorial Optimization, _x1388-3011 ; _v12 |
|
505 | 0 | _aThe 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 | _aThis 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 | _aComputer science. | |
650 | 0 | _aOperations research. | |
650 | 0 | _aDecision making. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aAlgorithms. | |
650 | 0 | _aMathematical optimization. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aOptimization. |
650 | 2 | 4 | _aOperation Research/Decision Theory. |
650 | 2 | 4 | _aAlgorithms. |
700 | 1 |
_aGutin, Gregory. _eeditor. |
|
700 | 1 |
_aPunnen, Abraham P. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9780387444598 |
830 | 0 |
_aCombinatorial Optimization, _x1388-3011 ; _v12 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b101971 |
912 | _aZDB-2-SMA | ||
950 | _aMathematics and Statistics (Springer-11649) | ||
999 |
_c508847 _d508847 |