Sinopsis
Excerpt from Tree-Search Algorithms for Quadratic Assignment Problems
In some contexts there may be constraints applicable to the problem which are not represented in the statement as embodied in (i) For example, there may be a restriction that plant i Ot be 10c3t9d at 3.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Tree-Search Algorithms for Quadratic Assignment Problems
In some contexts there may be constraints applicable to the problem which are not represented in the statement as embodied in (i) For example, there may be a restriction that plant i Ot be 10c3t9d at 3.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Reseña del editor
Excerpt from Tree-Search Algorithms for Quadratic Assignment Problems
Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or industrial engineer in laying out activities, offices or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility, and so on.
In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and describing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal.
In a subsequent paper we shall discuss our computational experience with a number of these algorithms.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Tree-Search Algorithms for Quadratic Assignment Problems...
Imagen del vendedor
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. 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. Nº de ref. del artículo: 9781332285556_0
Comprar nuevo
EUR 16,09
Gastos de envío gratis
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332285556
Comprar nuevo
EUR 23,00
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332285556
Comprar nuevo
EUR 24,78
Envío por EUR 3,81
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen del vendedor
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Publicado por
Forgotten Books Nov 2018, 2018
ISBN 10: 1332285554
ISBN 13: 9781332285556
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Neuware. Nº de ref. del artículo: 9781332285556
Comprar nuevo
EUR 26,41
Envío por EUR 61,14
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Publicado por
Forgotten Books, 2015
ISBN 10: 1332285554
ISBN 13: 9781332285556
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Nº de ref. del artículo: 26092905/2
Comprar usado
EUR 7,99
Envío por EUR 105,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles