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,437
Discovery Miles 44 370
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,437 Discovery Miles 44 370 | Repayment Terms: R416 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: December 1997
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
Promotions
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,584 Discovery Miles 25 840
Java Programming
Joyce Farrell Paperback R1,513 R1,434 Discovery Miles 14 340
Programming Logic & Design
Joyce Farrell Paperback R878 Discovery Miles 8 780
C++ Programming - Program Design…
D. Malik Paperback R1,929 R1,819 Discovery Miles 18 190
Program Construction - Calculating…
Roland Backhouse Paperback R1,555 Discovery Miles 15 550
Clean Architecture - A Craftsman's Guide…
Robert Martin Paperback  (1)
R681 Discovery Miles 6 810
Beginner's Step-by-Step Coding Course…
Dk Hardcover R716 Discovery Miles 7 160
Introducing Delphi Programming - Theory…
John Barrow, Linda Miller, … Paperback  (1)
R751 Discovery Miles 7 510
Programming Logic & Design…
Joyce Farrell Paperback R1,390 R1,315 Discovery Miles 13 150
Hardware Accelerator Systems for…
Shiho Kim, Ganesh Chandra Deka Hardcover R4,083 Discovery Miles 40 830
Dark Silicon and Future On-chip Systems…
Suyel Namasudra, Hamid Sarbazi-Azad Hardcover R4,072 Discovery Miles 40 720
Temporal Data Mining via Unsupervised…
Yun Yang Paperback R1,276 Discovery Miles 12 760

See more

Partners