.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
The Traveling Salesman Problem And Its V
. Ed(S): Gutin, Gregory; Punnen, Abraham P.
€ 377.58
FREE Delivery in Ireland
Description for The Traveling Salesman Problem And Its V
Hardback. Offers a treatment of a knotty problem in computing. This volume provides the developments in theory and algorithms for the traveling salesman problem (TSP). It covers the important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, and probabilistic aspects of TSP. Editor(s): Gutin, Gregory; Punnen, Abraham P. Series: Combinatorial Optimization. Num Pages: 830 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 44. Weight in Grams: 1359.
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.
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.
Product Details
Format
Hardback
Publication date
2002
Publisher
Kluwer Academic Publishers United States
Number of pages
830
Condition
New
Series
Combinatorial Optimization
Number of Pages
830
Place of Publication
New York, NY, United States
ISBN
9781402006647
SKU
V9781402006647
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for The Traveling Salesman Problem And Its V