Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 23,00
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 24,78
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Forgotten Books, London, Reino Unido
EUR 16,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. Print on Demand. This book explores tree-search algorithms for solving quadratic assignment problemsâ"an optimization problem that arises in a wide range of contexts. These problems involve assigning a number of entities to a number of mutually exclusive classes, with the objective of minimizing the total cost or distance associated with the assignments. The author presents a unified framework for comparing existing tree-search algorithms, including a discussion of their strengths and weaknesses. They also propose some alternative search strategies and other means of improving the efficiency of these algorithms. The book concludes with a discussion of the significance of the insights provided by these algorithms for solving quadratic assignment 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.
Idioma: Inglés
Publicado por Forgotten Books Nov 2018, 2018
ISBN 10: 1332285554 ISBN 13: 9781332285556
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 26,41
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware.
Librería: Buchpark, Trebbin, Alemania
EUR 7,99
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.