Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Kuriér GLS 3.99 € Zberné miesto GLS 2.49 € SPS 3.99 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Slovenská pošta 3.99 € Zberné miesto DPD 2.99 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

The Quadratic Assignment Problem: Theory and Algorithms

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

E. Cela

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 01423220

Nakladateľstvo Springer, Berlin, október 2010

The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numero... Celý popis

Libristo kód: 01423220

373 b

154.32 €

Skladom u dodávateľa Odosielame za 5-8 dní

Až 30 dní na vrátenie tovaru

Zákazníci tiež kúpili

Über die Grenze Ute E. Eisen

Pevná

148.86 €

Umweltschutz. Arbeitsgemeinschaft deutscher wirtschaftswissenschaftlicher Forschungsinstitute e. V.

Brožovaná

75.24 €

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

Brožovaná

4.64 €

Je T Oublierai Tous Jours Vassil Alexakis

Brožovaná

11.92 €

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

Brožovaná

29.42 €

Le retour de l'Africain blanc RUPP

Brožovaná

21.53 €

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

Adobe ePub DRM

5.45 €

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

Brožovaná

19.21 €

Die Buddenbrooks Thomas Mann

DVD

24.06 €

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

Brožovaná

51.87 €

Bierki w pudełku

Hra

3.93 €

Einführung ökologischer Produkte. Michael Böttger

Brožovaná

73.72 €

Reflexiones desde la Universidad Luis Herrera Mesa

Brožovaná

87.17 €

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

Brožovaná

35.39 €

Im Tal des Fuchses, 6 Audio-CDs Charlotte Link

Audio CD

11.11 €

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.