Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
EUR 5,81
Innerhalb der USA
Buchbeschreibung Zustand: New. New. In shrink wrap. Looks like an interesting title! 2.83. Bestandsnummer des Verkäufers Q-1402006640
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Hardcover. Zustand: new. Bestandsnummer des Verkäufers 9781402006647
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: 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. Bestandsnummer des Verkäufers 4092011
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9781402006647_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. pp. 852. Bestandsnummer des Verkäufers 26459466
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2411530141194
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: 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. Bestandsnummer des Verkäufers 9781402006647
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: Neu. Druck auf Anfrage 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. AudienceThis 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. Bestandsnummer des Verkäufers 9781402006647
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. pp. 852 Illus. Bestandsnummer des Verkäufers 7388437
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren