Traveling Salesman Problem and Its Variations, Hardcover by Gutin, Gregory (E...-image

Traveling Salesman Problem and Its Variations, Hardcover by Gutin, Gregory (E...

$ 184.48

Series: Combinatorial Optimization Ser. Subject: Computer Science, Combinatorics, Optimization, Discrete Mathematics Publication Year: 2002 Type: Textbook ISBN: 9781402006647 Language: English Subject Area: Mathematics, Computers Item Width: 6.1 in Number of Pages: Xviii, 830 Pages width: 6.1 in Author: Abraham P. Punnen Item Weight: 50.7 Oz Format: Hardcover Book Title: Traveling Salesman Problem and Its Variations Publication Name: Traveling Salesman Problem and Its Variations Item Length: 9.3 in Publisher: Springer

Description

Traveling Salesman Problem and Its Variations, Hardcover by Gutin, Gregory (E.... Traveling Salesman Problem and Its Variations, Hardcover by Gutin, Gregory (EDT); Punnen, Abraham P. (EDT), ISBN 1402006640, ISBN-13 9781402006647, Like New Used, Free shipping in the US 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). Th 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. Traveling Salesman Problem and Its Variations, Hardcover by Gutin, Gregory (EDT); Punnen, Abraham P. (EDT), ISBN 1402006640, ISBN-13 9781402006647, Like New Used, Free shipping in the US 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). Th 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.

Related products