Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

The Quadratic Assignment Problem: Theory and Algorithms

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

E. Cela

Idioma

Inglés

Libro Tapa blanda

Código Libristo: 01423220

Editores Springer, Berlin, octubre 2010

The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numero... Descripción completa

Código Libristo: 01423220

414 b

169.09 €

Almacenamiento externo Envío en 5-8 días

Hasta 30 días para devoluciones

Clientes que también han comprado

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

Tapa blanda

4.99 €

Trudności z jedzeniem u dzieci i nastolatków Agata Dutkiewicz Libro

Tapa dura

19.89 €

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

Tapa blanda

32.59 €

Umweltschutz. Arbeitsgemeinschaft deutscher wirtschaftswissenschaftlicher Forschungsinstitute e. V.

Tapa blanda

77.49 €

Le retour de l'Africain blanc RUPP

Tapa blanda

21.99 €

Über die Grenze Ute E. Eisen

Tapa dura

162.69 €

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

Adobe ePub DRM

5.79 €

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

Tapa blanda

19.69 €

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

Tapa blanda

56.99 €

Einführung ökologischer Produkte. Michael Böttger

Tapa blanda

66.99 €

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

Tapa blanda

38.39 €

Im Tal des Fuchses, 6 Audio-CDs Charlotte Link

CD de audio

12.29 €

Bierki w pudełku

Juego

4.99 €

Die Buddenbrooks Thomas Mann

DVD

25.39 €

Je T Oublierai Tous Jours Vassil Alexakis

Tapa blanda

12.19 €

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.