Traveling Salesman Problem and Its Variations

AvG. Gutin,A.P. Punnen

Häftad, Engelska, 2007

Del 12 i serien Combinatorial Optimization

3 297 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

3 937 kr

Inbunden

3 297 kr

Beskrivning

This volume, which contains chapters written by reputable researchers, 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, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.

Produktinformation

Utgivningsdatum:2007-05-18
Mått:155 x 235 x 49 mm
Vikt:1 228 g
Format:Häftad
Språk:Engelska
Serie:Combinatorial Optimization
Antal sidor:830
Upplaga:2007
Förlag:Springer-Verlag New York Inc.
ISBN:9780387444598

Utforska kategorier

Kombinatorik och grafteori inom Naturvetenskap och teknik

Recensioner i media

Select Guide Rating

Innehållsförteckning

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.

Mer från samma serie

Del 16

Concentrator Location in Telecommunications Networks

Hande Yaman

Inbunden, 2004

1 104 kr

Del 17

Shortest Connectivity

Dietmar Cieslik

Inbunden, 2004

1 104 kr

Combinatorial Optimization in Communication Networks

Maggie Xiaoyan Cheng, Yingshu Li, Ding-Zhu Du

Inbunden, 2006

1 652 kr

Del 1

Quadratic Assignment Problem

E. Cela

Inbunden, 1997

1 652 kr

Combinatorial Engineering of Decomposable Systems

M.S. Levin

Inbunden, 1998

1 652 kr

Discrete and Fractional Programming Techniques for Location Models

A.I. Barros

Inbunden, 1998

1 213 kr

Del 4

Geometric Methods and Optimization Problems

Vladimir Boltyanski, Horst Martini, V. Soltan

Inbunden, 1998

3 077 kr

Advances in Randomized Parallel Computing

M. Pardalos Pardalos, Panos M. Pardalos, Sanguthevar Rajasekaran

Inbunden, 1999

1 652 kr

Del 6

Advances in Steiner Trees

Ding-Zhu Du, J.M. Smith, J. Hyam Rubinstein

Inbunden, 2000

1 104 kr

Del 7

Nonlinear Assignment Problems

Panos M. Pardalos, L.S. Pitsoulis

Inbunden, 2000

1 652 kr

Du kanske också är intresserad av

10% rabatt på allt

Adventskalender Ravensburger pussel 2026

Ravensburger

319 kr

Del 12