[request_ebook] The Quadratic Assignment Problem: Theory and Algorithms (Combinatorial Optimization)

Description

• Author: E. Cela
• Publisher: Springer; 1st edition (January 15, 1998)
• Pages: 287

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.

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "[request_ebook] The Quadratic Assignment Problem: Theory and Algorithms (Combinatorial Optimization)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 1823
2. [request_ebook] Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization)
3. Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
4. Combinatorial Optimization: Theory and Algorithms ...
5. Combinatorial Optimization: Theory and Algorithms
6. [request_ebook] Quadratic Assignment and Related Problems: Dimacs Workshop May 20-21, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science,)
7. Approximation Algorithms for Combinatorial Optimization
8. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problem
9. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
10. Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics
11. Combinatorial Network Theory (Applied Optimization)
12. Combinatorial Algorithms: Theory and Practice
13. [request_ebook] Stochastic Optimization: Algorithms and Applications (Applied Optimization, Volume 54)
14. Graph Theory and Combinatorial Optimization (Gerad 25th Anniversary Series)
15. Graph Theory and Combinatorial Optimization (Gerad 25th Anniversary Series)
16. [request_ebook] Handbook of Combinatorial Optimization: Vol. 1-3