Cantitate/Preț
Produs
Total produse
Vezi coșul
The Traveling Salesman Problem and Its Variations de G. Gutin

The Traveling Salesman Problem and Its Variations: Combinatorial Optimization, cartea 12

Editat de G. Gutin, A.P. Punnen
en Limba Engleză Paperback – 18 mai 2007
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 185027 lei  6-8 săpt.
  Springer Us – 18 mai 2007 185027 lei  6-8 săpt.
Hardback (1) 185394 lei  6-8 săpt.
  Springer Us – 31 mai 2002 185394 lei  6-8 săpt.

Din seria Combinatorial Optimization

Preț: 185027 lei

Preț vechi: 231284 lei
-20% Nou

Puncte Express: 2775
Preț estimativ în valută:
32742€ • 38183$ • 28748£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387444598
ISBN-10: 0387444599
Pagini: 830
Ilustrații: XVIII, 830 p.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.18 kg
Ediția:2007
Editura: Springer Us
Colecția Springer
Seria Combinatorial Optimization

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.
Audience
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.

Caracteristici

Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP) Written by reputable researchers, covering all important areas of study on TSP Intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research Appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects