0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

The Quadratic Assignment Problem - Theory and Algorithms (Hardcover, 1998 ed.) Loot Price: R4,675
Discovery Miles 46 750
The Quadratic Assignment Problem - Theory and Algorithms (Hardcover, 1998 ed.): E. Cela

The Quadratic Assignment Problem - Theory and Algorithms (Hardcover, 1998 ed.)

E. Cela

Series: Combinatorial Optimization, 1

 (sign in to rate)
Loot Price R4,675 Discovery Miles 46 750 | Repayment Terms: R438 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer
Country of origin: Netherlands
Series: Combinatorial Optimization, 1
Release date: 2001
First published: 1998
Authors: E. Cela
Dimensions: 234 x 156 x 19mm (L x W x T)
Format: Hardcover
Pages: 287
Edition: 1998 ed.
ISBN-13: 978-0-7923-4878-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > Computer programming > General
Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN: 0-7923-4878-8
Barcode: 9780792348788

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,431 Discovery Miles 24 310
Sams Teach Yourself: Beginning…
Greg Perry, Dean Miller Paperback R755 R581 Discovery Miles 5 810
C++ Programming - Program Design…
D. Malik Paperback R1,728 R1,490 Discovery Miles 14 900
Program Construction - Calculating…
Roland Backhouse Paperback R1,443 Discovery Miles 14 430
Programming Logic & Design…
Joyce Farrell Paperback R1,304 R1,123 Discovery Miles 11 230
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
C++ How to Program: Horizon Edition
Harvey Deitel, Paul Deitel Paperback R1,893 Discovery Miles 18 930
Starting Out with Python, Global Edition
Tony Gaddis Paperback R2,157 Discovery Miles 21 570
Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,210 Discovery Miles 22 100
Implementation Patterns
Kent Beck Paperback R1,005 Discovery Miles 10 050
Using UML - Software Engineering with…
Perdita Stevens Paperback R2,219 Discovery Miles 22 190
Object-Oriented Game Development
Julian Gold Paperback R2,292 R1,753 Discovery Miles 17 530

See more

Partners