Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier Sameday 24.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

The Quadratic Assignment Problem: Theory and Algorithms

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

E. Cela

Limba

engleză

Carte Carte broșată

Codul Libristo: 01423220

Editura Springer, Berlin, octombrie 2010

The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numero... Descrierea completă

Codul Libristo: 01423220

394 b

851.64 lei

În depozitul extern Expediem în 5-8 zile

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

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

Carte broșată

25.33 lei

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

Copertă tare

103.86 lei

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

Carte broșată

163.28 lei

Umweltschutz. Arbeitsgemeinschaft deutscher wirtschaftswissenschaftlicher Forschungsinstitute e. V.

Carte broșată

390.03 lei

Le retour de l'Africain blanc RUPP

Carte broșată

113.94 lei

Über die Grenze Ute E. Eisen

Copertă tare

820.27 lei

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

Adobe ePub DRM

28.76 lei

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

Carte broșată

102.10 lei

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

Carte broșată

286.78 lei

Einführung ökologischer Produkte. Michael Böttger

Carte broșată

331.55 lei

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

Carte broșată

203.37 lei

Im Tal des Fuchses, 6 Audio-CDs Charlotte Link

Audio CD

61.90 lei

Bierki w pudełku

Joc

26.16 lei

Die Buddenbrooks Thomas Mann

DVD

126.30 lei

Je T Oublierai Tous Jours Vassil Alexakis

Carte broșată

63.14 lei

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.