Del 12 - Combinatorial Optimization

Traveling Salesman Problem and Its Variations

Häftad, Engelska, 2007

4 049 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Written by reputable researchers, this book covers various important areas of study on Traveling Salesman Problem, 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, and more.

Produktinformation

Utgivningsdatum2007-05-18
Mått155 x 235 x 49 mm
Vikt1 228 g
FormatHäftad
SpråkEngelska
SerieCombinatorial Optimization
Antal sidor830
Upplaga2007
FörlagSpringer-Verlag New York Inc.
ISBN9780387444598

Tillhör följande kategorier

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.