The Quadratic Assignment Problem: Theory and Algorithms

Name: The Quadratic Assignment Problem: Theory and Algorithms
Brand: Springer, Berlin
SKU: 9781441947864
Price: 892.84 RON
Availability: InStock

Autor: E. Cela

Limbă:

Legare: Carte broșată

Editura: Springer, Berlin

Disponibilitate: În depozitul extern în cantități mici

Expediem în 13-18 zile

892.84 lei

The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numero...

Informații despre carte

Autor

E. Cela

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2010

Pagini

287

EAN

9781441947864

ISBN

1441947868

Enbook ID

01423220

Editura

Springer, Berlin

Greutate

597

Dimensiuni

160 x 240 x 16

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

The Quadratic Assignment Problem: Theory and Algorithms

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și