Mon compte Ma liste - 0
	Catalogue   Ressources numériques   Nouveautés   Liens utiles   Mon compte

Recherche rapide Recherche avancée Recherche alphabétique Historique Information

Recherche  AuteurTitreSujetTitre de revueCollectionCotes BUCotes ENSEACotes IUFM       Modifier la recherche     > CERGY

Elargir la recherche         Sur le même sujet :     Computational complexity.     MATHEMATICS -- Graphic Methods     Traveling salesman problem     Mathematik     MATHEMATICS -- General     Parcourir le catalogue     par auteur:      Cook , William J. , 1938-....       Rechercher sur Internet     Localiser dans une autre bibliothèque (SUDOC) (PPN ou ISBN ou ISSN)     Aperçu dans Google Books     Affichage MARC

Auteur :  Cook , William J. , 1938-.... Titre :  In pursuit of the traveling salesman : mathematics at the limits of computation , William J. Cook Editeur :  Princeton, N.J : Princeton University Press , 2015 ISBN:  978-1-400-83959-9 978-1-4008-3959-9 Notes :  CookWilliam J.: William J. Cook is professor of combinatorics and optimization at the University of Waterloo. He is the coauthor of "The Traveling Salesman Problem: A Computational Study" (Princeton) Description based on online resource; title from PDF title page (publisher s Web site, viewed February 28, 2015) Numérisation de l'édition de Princeton University Press La pagination de l'édition imprimée correspondante est de : 248p. Reproduction électronique. Princeton, N.J. : Princeton University Press, 2015. Mode d'accès : Internet. System requirements: Web browser. Access may be restricted to users at subscribing institutions. What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman s trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today s state-of-the-art attempts to solve it. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem.Some images inside the book are unavailable due to digital copyright restrictions Nécessite un navigateur et un lecteur de fichier PDF URL:  (Accès réservé aux étudiants de l'ENSEA) http://univ.scholarvox.com.ez-proxy.ensea.fr/book/88827140 Sujet :  Computational complexity. MATHEMATICS -- Graphic Methods Traveling salesman problem Mathematik MATHEMATICS -- General   Exemplaires Site Emplacement Cote Type de prêt Statut   Ensea Ressources numériques ENSEA-SCHOLARV Consultation en ligne Disponible

Pour toute question, contactez la bibliothèque

Horizon Information Portal 3.0© 2001-2019 SirsiDynix Tous droits réservés.