The Quadratic Assignment Problem

Theory and Algorithms

By:

E Cela

Format:

Hardback

Series:

Combinatorial Optimization

Show Hide Adult Content

$452.00

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Free Delivery with Primate

Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $113.00 with Afterpay Learn more

6 weekly interest-free payments of $75.33 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

Around 7-19 June using International Courier

Description

The 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.

Release date NZ

December 31st, 1997

Author

E Cela

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational
Undergraduate

Illustrations

XV, 287 p.

Pages

287

Series

Combinatorial Optimization

Dimensions

156x234x19

ISBN-13

9780792348788

Product ID

2437531

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Get free delivery, exclusive deals, and more^*

Non-Fiction Books:

The Quadratic Assignment Problem

By:

Format:

Series:

Buy Now, Pay Later with:

Availability

Description

Customer reviews

Marketplace listings

Help & options

Filed under...

Get free delivery, exclusive deals, and more*

Buy Now, Pay Later with:

Get free delivery, exclusive deals, and more^*