The traveling salesman problem and its variations

Contributor(s):

Material type: Text

TextSeries: Combinatorial optimization: 12Publication details: New York Springer 2007Description: xv, 830 pISBN:

9780387444598

Subject(s):

DDC classification:

519.64 T7

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
Book	Ahmedabad	519.64 T7 (Browse shelf(Opens below))	Available		177653

Total holds: 0

Browsing Ahmedabad shelves Close shelf browser (Hides shelf browser)

						Next
	519.64 K6C6-2012 Combinatorial optimization: theory and algorithms	519.64 T7 The traveling salesman problem and its variations	519.7 B3L4 Linear programming: active set analysis and computer programs	519.7 B4I6 Introduction to stochastic programming	519.7 B8B2 Basic optimisation methods	Next

Originally published: Dordrecht ; Boston : Kluwer Academic Publishers, c2002.
Includes bibliographical references (p. [761]-806) and index.

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.

There are no comments on this title.

to post a comment.