A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Shipping:
US$ 6.22
Within U.S.A.
Book Description Condition: New. New. In shrink wrap. Looks like an interesting title! 2.83. Seller Inventory # Q-1402006640
Book Description Hardcover. Condition: new. Seller Inventory # 9781402006647
Book Description Condition: New. pp. 852. Seller Inventory # 26459466
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9781402006647_lsuk
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP)Written by reputable researchers, covering all important areas of study on TSPIntended for researchers, practitioners, and academicians in mathem. Seller Inventory # 4092011
Book Description Condition: New. Seller Inventory # ABLIING23Mar2411530141194
Book Description Condition: New. pp. 852 Illus. Seller Inventory # 7388437
Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms. 852 pp. Englisch. Seller Inventory # 9781402006647
Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. AudienceThis 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. Seller Inventory # 9781402006647