L'édition de cet ISBN n'est malheureusement plus disponible.
This book explores inverse spanning tree problems, a novel approach to measuring deviation from optimality. The author demonstrates how to formulate these problems as duals of assignment and transportation problems, opening up new avenues for efficient solutions. By presenting a detailed algorithm for the assignment problem and adapting cost scaling algorithms for transportation problems, the book provides practical methods for addressing inverse spanning tree problems in a range of time complexities. The author also examines weighted and minimax variations of the problem, expanding its applicability. Through these insights, this book not only contributes to the field of network optimization but also sheds light on the broader concept of deviation from optimality, making it a valuable resource for researchers and practitioners alike.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
(Aucun exemplaire disponible)
Chercher: Créez une demandeVous ne trouvez pas le livre que vous recherchez ? Nous allons poursuivre vos recherches. Si l'un de nos libraires l'ajoute aux offres sur AbeBooks, nous vous le ferons savoir !
Créez une demande