Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

The Quadratic Assignment Problem: Theory and Algorithms

Name: The Quadratic Assignment Problem: Theory and Algorithms
Brand: Springer, Berlin
SKU: 01423220
Price: 181.49 EUR
Availability: InStock
Author: E. Cela
ISBN: 9781441947864

E. Cela

Language

English

Book Paperback

Libristo code: 01423220

Publishers Springer, Berlin, October 2010

The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numero... Full description

Libristo code: 01423220

444 b

181.49 € VAT included

Low in stock at our supplier Shipping in 13-18 days

Delivery to Austria

30-day return policy

Customers also purchased

Kulturhistorische Betrachtungen des Klabautermanns - Fünftes Bändchen. Bd.5 Siegfried Harmel

Paperback

4.79 €

Gestión de enfermería en el contexto de la calidad M. de Oliveira Fani Amaro

Paperback

30.79 €

Umweltschutz. Arbeitsgemeinschaft deutscher wirtschaftswissenschaftlicher Forschungsinstitute e. V.

Paperback

83.59 €

Je T Oublierai Tous Jours Vassil Alexakis

Paperback

12.49 €

Los italianos de Parral. La colonia antes de Colonia Dignidad Stefano Micheletti Dellamaria

Adobe ePub DRM

5.69 €

Über die Grenze Ute E. Eisen

Hardback

171.79 €

Le monde professionnel de demain rimera avec créativité, diversité,agilité et adaptabilité totale Keith Ferrazzi

Paperback

20.09 €

GSM Global System for Mobile Communication Jörg Eberspächer

Paperback

65.69 €

Einführung ökologischer Produkte. Michael Böttger

Paperback

65.79 €

Im Tal des Fuchses, 6 Audio-CDs Charlotte Link

Audio CD

12.99 €

Lettres Du Comte de Lude Et Autres Personnages, Relatives A l'Administration Du Poitou, 1559-1580 SANS AUTEUR

Paperback

38.39 €

Bierki w pudełku

Game

4.39 €

Die Buddenbrooks Thomas Mann

DVD

24.89 €

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.