Articoli correlati a Traveling Salesman Problem and Its Variations: 12
Sinossi
<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>
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
<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>
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Traveling Salesman Problem and Its Variations: 12
Foto dell'editore
The Traveling Salesman Problem and Its Variations (Volume 12)
Da: Anybook.com, Lincoln, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 7866724
Compra usato
EUR 24,80
Spedizione EUR 15,49
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem and Its Variations (Combinatorial Optimization, 12)
Da: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Codice articolo OTV.1402006640.G
Compra usato
EUR 192,28
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem and Its Variations
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 4092011
Compra nuovo
EUR 267,86
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
The Traveling Salesman Problem and Its Variations
Da: Books Puddle, Woodside, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 852. Codice articolo 26459466
Compra nuovo
EUR 317,26
Spedizione EUR 3,55
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
The Traveling Salesman Problem and Its Variations
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 852 Illus. Codice articolo 7388437
Compra nuovo
EUR 330,72
Spedizione EUR 7,65
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
The Traveling Salesman Problem and Its Variations
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 852. Codice articolo 18459456
Compra nuovo
EUR 329,20
Spedizione EUR 9,95
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem and Its Variations
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9781402006647
Compra nuovo
EUR 320,99
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
The Traveling Salesman Problem and Its Variations (Combinatorial Optimization, 12)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In English. Codice articolo ria9781402006647_new
Compra nuovo
EUR 348,07
Spedizione EUR 17,58
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem and Its Variations
Editore:
Springer, Springer Mai 2002, 2002
ISBN 10: 1402006640
ISBN 13: 9781402006647
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9781402006647
Compra nuovo
EUR 320,99
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
The Traveling Salesman Problem and Its Variations
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9781402006647
Compra nuovo
EUR 338,77
Spedizione EUR 44,98
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili