The Traveling Salesman Problem and Its Variations

Author:   G. Gutin ,  A.P. Punnen
Publisher:   Springer-Verlag New York Inc.
Edition:   New edition
Volume:   12
ISBN:  

9780387444598


Pages:   830
Publication Date:   18 May 2007
Format:   Paperback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $300.96 Quantity:  
Add to Cart

Share |

The Traveling Salesman Problem and Its Variations


Add your own review!

Overview

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.

Full Product Details

Author:   G. Gutin ,  A.P. Punnen
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   New edition
Volume:   12
Dimensions:   Width: 15.50cm , Height: 4.20cm , Length: 23.50cm
Weight:   1.282kg
ISBN:  

9780387444598


ISBN 10:   0387444599
Pages:   830
Publication Date:   18 May 2007
Audience:   College/higher education ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

The Traveling Salesman Problem: Applications, Formulations and Variations.- Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP.- Polyhedral Theory for the Asymmetric Traveling Salesman Problem.- Exact Methods for the Asymmetric Traveling Salesman Problem.- Approximation Algorithms for Geometric TSP.- Exponential Neighborhoods and Domination Analysis for the TSP.- Probabilistic Analysis of the TSP.- Local Search and Metaheuristics.- Experimental Analysis of Heuristics for the STSP.- Experimental Analysis of Heuristics for the ATSP.- Polynomially Solvable Cases of the TSP.- The Maximum TSP.- The Generalized Traveling Salesman and Orienteering Problems.- The Prize Collecting Traveling Salesman Problem and its Applications.- The Bottleneck TSP.- TSP Software.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List