|
 |
|
 |
 |
The Quadratic Assignment Problem: Theory and Algorithms (Combinatorial Optimization)
|
by E. Cela
Sales Rank: 3353640
|
Discount: 54 %
$170.48
At Amazon
|
|
Hardcover: 287 pages
Publisher: Springer; 1st edition January 15, 1998
Language: English
ISBN-10: 0792348788
ISBN-13: 978-0792348788
Product Dimensions:
9.5 x 6.4 x 0.9 inches
Shipping Weight: 1.4 pounds
Product Review
` will be primarily of interest to researchers in the field of mathematics for operational research. Practitioners wanting to read the book, however, will find all the necessary references in order to understand the mathematical terminology. The book can also be recommended to young researchers and to PhD students seeking challenging problems.'
Journal of the Operational Research Society, 50:5 (1999)
Book Description
The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numerous applications in facility location, scheduling, manufacturing, VLSI design, statistical data analysis, etc. The QAP is an extremely hard problem from both theoretical and practical points of view: 1) The QAP is NP-hard to solve to optimality and to approximate within a constant approximation ratio, and 2) QAP instances of size larger than 22 are still considered intractable. Hence, the QAP is in effect a problem that has yet to be solved.
This volume presents a general overview of the most studied aspects of the QAP, as well as outlining a number of research directions which currently seem to be promising. The book gives a systematic presentation of various results scattered in the literature, such as: bounding techniques and exact solution methods, linearisations, heuristic approaches and computational complexity. Some more recent research directions discussed in detail in the book are the asymptotic behaviour of the QAP and restricted versions of the problem: in particular, polynomially solvable and provably hard cases of the QAP.
Audience: This volume will be of interest to researchers and students interested in the quadratic assignment problem and to practitioners who face the QAP and wish to better understand this problem in its inherent complexity.
Customer Reviews & Comments
This monograph is a very good survey of the QAP and its variations. The treatment is however far from complete. The exact method section excludes a lot of recent developments including RLT of Sherali and Adams. Recent results on polyhedral studies into the QAP polytope are missing. The heuristic methods is skinny and is missing neural network methods. Certain QAP variations such as placement problem are not covered. A chapter on QAP applications would have been helpful. Nevertheless, it provides a very good overview of a very important NP-hard problem: QAP
Comment | Permalink |
(Report this)
|
The Quadratic Assignment Problem: Theory and Algorithms (Combinatorial Optimization)
Discount: 54 %
Available from Amazon
Price: $170.48
| |
|
|
|
|
