The Quadratic Assignment Problem

The Quadratic Assignment Problem : Theory and Algorithms

By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?


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.
show more

Product details

  • Hardback | 287 pages
  • 162.6 x 241.3 x 22.9mm | 635.04g
  • Dordrecht, Netherlands
  • English
  • 1998 ed.
  • XV, 287 p.
  • 0792348788
  • 9780792348788

Table of contents

Preface. List of Figures. List of Tables. 1. Problem Statement and Complexity Aspects. 2. Exact Algorithms and Lower Bounds. 3. Heuristics and Asymptotic Behavior. 4. QAPs on Specially Structured Matrices. 5. Two More Restricted Versions of the QAP. 6. QAPs Arising as Optimization Problems in Graphs. 7. On the Biquadratic Assignment Problem (BIQAP). References. Notation Index. Subject Index.
show more

Review quote

`... 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)
show more