Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity - Couverture rigide

Neumann, Frank; Witt, Carsten

9783642165436: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity

Couverture rigide

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2010

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

12 Neuf

De EUR 48,37

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.

The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.

This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

� propos de l?auteur

Authors have given tutorials on this topic at major international conferences

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Date d'�dition: 2010
Langue: anglais
ISBN 10: 3642165435
ISBN 13: 9783642165436
Reliure: Reli�
Nombre de pages: 216
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter neuf

Afficher cet article

EUR 48,37

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783642265846: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity

Edition pr�sent�e

ISBN 10 : 3642265847 ISBN 13 : 9783642265846
Editeur : Springer, 2013
Couverture souple

(Couverture souple)

R�sultats de recherche pour Bioinspired Computation in Combinatorial Optimization:...

Image fournie par le vendeur

Bioinspired Computation in Combinatorial Optimization

Frank Neumann|Carsten Witt

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors have given tutorials on this topic at major international conferencesText has been class-tested by the authors and their collaboratorsComprehensive introduction for researchers Bioinspired computing is successful in pract. N� de r�f. du vendeur 5051184

Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity

Carsten Witt

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. N� de r�f. du vendeur 9783642165436

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Bioinspired Computation in Combinatorial Optimization

Carsten Witt

Edit� par Springer Berlin Heidelberg Nov 2010, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. 228 pp. Englisch. N� de r�f. du vendeur 9783642165436

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Natural Computing Series)

Neumann, Frank; Witt, Carsten

Edit� par Springer, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783642165436_new

Contacter le vendeur

Acheter neuf

EUR 60,55

Autre devise

Frais de port : EUR 4,62

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Hardback or Cased Book)

Neumann, Frank

Edit� par Springer 11/5/2010, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Hardback or Cased Book. Etat : New. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity 0.74. Book. N� de r�f. du vendeur BBS-9783642165436

Contacter le vendeur

Acheter neuf

EUR 55,67

Autre devise

Frais de port : EUR 10,65

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Bioinspired Computation in Combinatorial Optimization

Carsten Witt

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2010, 2010

ISBN 10 : 3642165435 ISBN 13 : 9783642165436

Neuf Couverture rigide

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. Etat : Neu. Neuware -Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. N� de r�f. du vendeur 9783642165436

Contacter le vendeur