000			03472nam a22004935i 4500
001			978-0-306-48213-7
003			DE-He213
005			20260127102353.0
007			cr nn 008mamaa
008			100301s2007 xxu| s |||| 0|eng d
020			_a9780306482137
024	7		_a10.1007/b101971 _2doi
040			_cCICY
082	0	4	_a004.0151 _223
100	1		_aGutin, Gregory. _eeditor.
245	1	4	_aThe Traveling Salesman Problem and Its Variations _h[recurso electrónico] / _cedited by Gregory Gutin, Abraham P. Punnen.
264		1	_aBoston, MA : _bSpringer US : _bImprint: Springer, _c2007.
300			_aXXXVI, 829 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _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	_aCOMPUTATIONAL COMPLEXITY.
650		0	_aALGORITHMS.
650		0	_aMATHEMATICAL OPTIMIZATION.
650		0	_aOPERATIONS RESEARCH.
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		_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 _zVer el texto completo en las instalaciones del CICY
942			_2ddc _cER
999			_c55874 _d55874