An Algorithm for the Traveling Salesman Problem (Classic Reprint) - Couverture souple

Little, John D. C.

9781334214998: An Algorithm for the Traveling Salesman Problem (Classic Reprint)

Couverture souple

ISBN 10 : 1334214999 ISBN 13 : 9781334214998

Editeur : Forgotten Books, 2019

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

3 Neuf

De EUR 15,88

D�tails de l'�dition

�diteur: Forgotten Books
Date d'�dition: 2019
Langue: anglais
ISBN 10: 1334214999
ISBN 13: 9781334214998
Reliure: Broch�
Nombre de pages: 82
Coordonn�es du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com
gpsr@podww.com

9 Culley Court
Orton Southgate
Peterborough
Cambridgeshire
PE2 6WA
Royaume-Uni
Personne responsable: Easy Access System Europe O�, 16879218
+358405003575
gpsr.requests@easproject.com

Mustam�e tee 50
Tallinn
10621
Estonie

Autres �ditions populaires du m�me titre

9780656234806: An Algorithm for the Traveling Salesman Problem (Classic Reprint)

Edition pr�sent�e

ISBN 10 : 0656234806 ISBN 13 : 9780656234806
Editeur : Forgotten Books, 2019
Couverture rigide

R�sultats de recherche pour An Algorithm for the Traveling Salesman Problem (Classic...

Image fournie par le vendeur

An Algorithm for the Traveling Salesman Problem (Classic Reprint)

John D. C. Little, Katta G. Murty

Edit� par Forgotten Books, 2024

ISBN 10 : 1334214999 ISBN 13 : 9781334214998

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 4 sur 5 �toiles

Paperback. Etat : New. Print on Demand. In the realm of mathematical optimization, this book presents a ground-breaking algorithm for solving the renowned traveling salesman problem. The author ingeniously devised a method that breaks complex problems into smaller, more manageable subsets, leveraging an approach that has since become known as "branch and bound." This technique has expanded the scale of problems that can be efficiently solved, enabling significant advancements in the field. At its core, the book explores the intricate balance between computational efficiency and the quest for optimal solutions. It elucidates how the algorithm operates, from its initial branching to its meticulous lower bound calculations, providing a comprehensive understanding of its workings. Through illuminating examples and detailed analysis, the book equips readers to grasp the mathematical underpinnings and practical applications of this powerful optimization technique. Its insights have had a far-reaching impact, solidifying the "branch and bound" approach as a cornerstone in the field of mathematical optimization and paving the way for further breakthroughs in solving complex real-world problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N� de r�f. du vendeur 9781334214998_0

Contacter le vendeur