The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint) - Couverture souple

Bertsimas, Dimitris

9781332276097: The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint)

Couverture souple

ISBN 10 : 1332276091 ISBN 13 : 9781332276097

Editeur : Forgotten Books, 2018

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

3 Neuf

De EUR 15,32

D�tails de l'�dition

�diteur: Forgotten Books
Date d'�dition: 2018
Langue: anglais
ISBN 10: 1332276091
ISBN 13: 9781332276097
Reliure: Broch�
Nombre de pages: 50
Coordonn�es du fabricant: non disponible
Personne responsable: non disponible

Autres �ditions populaires du m�me titre

9780265619247: The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint)

Edition pr�sent�e

ISBN 10 : 0265619246 ISBN 13 : 9780265619247
Editeur : Forgotten Books, 2018
Couverture rigide

R�sultats de recherche pour The Probabilistic Minimum Spanning Tree Problem: Complexity...

Image fournie par le vendeur

The Probabilistic Minimum Spanning Tree Problem (Classic Reprint)

Dimitris Bertsimas

Edit� par Forgotten Books, 2018

ISBN 10 : 1332276091 ISBN 13 : 9781332276097

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : New. Print on Demand. This book explores the probabilistic minimum spanning tree problem (PMST), a probabilistic variation of the classic minimum spanning tree problem. Unlike its deterministic counterpart, the PMST considers situations where not all points are deterministically present, but instead have certain probabilities of presence. The author, a respected researcher in the field, delves into the complexity and combinatorial properties of the problem, proving that even a restricted version of the PMST with all weights equal is NP-complete, a surprising result given the simplicity of the MST problem. The book also examines the relationship between the PMST problem and the MST, network design, and re-optimization strategies, providing valuable insights into the problem's nature and potential applications. Through the author's rigorous analysis and clear explanations, this book offers a comprehensive understanding of the PMST problem, its complexities, and its implications in the broader field of combinatorial optimization. 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 9781332276097_0

Contacter le vendeur