Tracked shipping to New Zealand with premium packaging for just NZ$15 

Ship to
New Zealand
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada the quadratic assignment problem: theory and algorithms
Type
Physical Book
Author
Publisher
Year
2010
Language
English
Pages
287
Format
Paperback
Dimensions
23.4 x 15.6 x 1.6 cm
Weight
0.43 kg.
ISBN
1441947868
ISBN13
9781441947864
Categories

the quadratic assignment problem: theory and algorithms

E. Cela (Author) · Springer · Paperback

the quadratic assignment problem: theory and algorithms - Cela, E.

Cheaper New Book Imported to New Zealand
Delivery: 24 Jul - 05 Aug Shipping: 13 to 17 business days.
NZ$ 317.42
Faster New Book Imported to New Zealand
Delivery: 14 Jul - 21 Jul Shipping: 5 to 6 business days.
NZ$ 406.84
Import costs and 15% GST included in the price ✅
NZ$ 317.42

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "the quadratic assignment problem: theory and algorithms"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews