Description: The Quadratic Assignment Problem Please note: this item is printed on demand and will take extra time before it can be dispatched to you (up to 20 working days). Theory and Algorithms Author(s): E. Cela Format: Paperback Publisher: Springer-Verlag New York Inc., United States Imprint: Springer-Verlag New York Inc. ISBN-13: 9781441947864, 978-1441947864 Synopsis 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.
Price: 103.96 GBP
Location: Aldershot
End Time: 2024-12-27T12:03:57.000Z
Shipping Cost: 37.91 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 60 days
Return policy details:
Book Title: The Quadratic Assignment Problem
Number of Pages: 287 Pages
Language: English
Publication Name: The Quadratic Assignment Problem: Theory and Algorithms
Publisher: Springer-Verlag New York Inc.
Publication Year: 2010
Subject: Computer Science, Mathematics
Item Height: 244 mm
Item Weight: 597 g
Type: Textbook
Author: E. Cela
Series: Combinatorial Optimization
Item Width: 170 mm
Format: Paperback
