Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)

Angebote / Angebote:

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.