The Quadratic Assignment Problem - Theory and Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 1998)

The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Combinatorial Optimization, 1
Release date:	December 2010
First published:	1998
Authors:	E. Cela
Dimensions:	244 x 170 x 16mm (L x W x T)
Format:	Paperback
Pages:	287
Edition:	Softcover reprint of hardcover 1st ed. 1998
ISBN-13:	978-1-4419-4786-4
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Mathematics > Optimization > General Promotions
LSN:	1-4419-4786-8
Barcode:	9781441947864

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!