<p>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.</p>
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
<p>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. </p><p><em>Audience</em></p><p>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.</p>
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Poor. Volume 12. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Book contains pencil markings. In poor condition, suitable as a reading copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1350grams, ISBN:9781402006647. N° de réf. du vendeur 7866724
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 TSPIntended for researchers, practitioners, and academicians in mathem. N° de réf. du vendeur 4092011
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. pp. 852. N° de réf. du vendeur 26459466
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 788438-n
Quantité disponible : 15 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du vendeur 6666-IUK-9781402006647
Quantité disponible : 20 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 852 pp. Englisch. N° de réf. du vendeur 9781402006647
Quantité disponible : 2 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 852 Illus. N° de réf. du vendeur 7388437
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 852. N° de réf. du vendeur 18459456
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9781402006647_new
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 852 pp. Englisch. N° de réf. du vendeur 9781402006647
Quantité disponible : 1 disponible(s)