Plus d’un million de livres à portée de main !
Bookbot

Combinatorial Optimization: The Traveling Salesman Problem and Its Variations

Paramètres

  • 830pages
  • 30 heures de lecture

En savoir plus sur le livre

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.

Achat du livre

Combinatorial Optimization: The Traveling Salesman Problem and Its Variations, Gregory Gutin, Abraham P. Punnen

Langue
Année de publication
2007
product-detail.submit-box.info.binding
(souple),
État du livre
Bon
Prix
67,99 €

Modes de paiement

Personne n'a encore évalué .Évaluer