|
![]() |
|||
|
||||
OverviewThe quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numerous applications in facility location, scheduling, manufacturing, VLSI design, and statistical data analysis. The QAP is a problem from both theoretical and practical points of view: the QAP is NP-hard to solve to optimality and to approximate within a constant approximation ratio; and 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 in the 1990s 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, linearizations, 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. This volume should 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. Full Product DetailsAuthor: E. CelaPublisher: Springer Imprint: Springer Edition: 1998 ed. Volume: 1 Dimensions: Width: 15.60cm , Height: 1.90cm , Length: 23.40cm Weight: 1.350kg ISBN: 9780792348788ISBN 10: 0792348788 Pages: 287 Publication Date: 31 December 1997 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1 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.Reviews`... 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) '... 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) ... 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) Author InformationTab Content 6Author Website:Countries AvailableAll regions |