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

$ 184.48

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

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.