عنوان

Bioinspired computation in combinatorial optimization :

شابک

3642165435

شابک

3642165443

شابک

3642165451

شابک

3642265847

شابک

9783642165436

شابک

9783642165443

شابک

9783642165450

شابک

9783642265846

شابک اشتباه

9783642165436

شماره

b736812

عنوان اصلي

Bioinspired computation in combinatorial optimization :

نام عام مواد

[Book]

ساير اطلاعات عنواني

algorithms and their computational complexity /

نام نخستين پديدآور

Frank Neumann, Carsten Witt.

محل نشرو پخش و غیره

Heidelberg :

نام ناشر، پخش کننده و غيره

Springer,

تاریخ نشرو بخش و غیره

©2010.

نام خاص و کميت اثر

1 online resource (xii, 216 pages)

عنوان فروست

Natural computing series

متن يادداشت

Includes bibliographical references.

متن يادداشت

pt. 1. Basics -- pt. 2. Single-objective optimization -- pt. 3. Multi-objective optimization.

بدون عنوان

0

متن يادداشت

Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these search heuristics. This is the first book to explain the most important results achieved in this area. The authors show how runtime behavior can be analyzed in a rigorous way. in particular for combinatorial optimization. They present well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Classical single-objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help to speed up bioinspired computation for single-objective optimization problems. This book will be valuable for graduate and advanced undergraduate courses on bioinspired computation, as it offers clear assessments of the benefits and drawbacks of various methods. It offers a self-contained presentation, theoretical foundations of the techniques, a unified framework for analysis, and explanations of common proof techniques, so it can also be used as a reference for researchers in the areas of natural computing, optimization and computational complexity.

منبع سفارش / آدرس اشتراک

Springer

شماره انبار

978-3-642-16543-6

شماره استاندارد بين المللي کتاب و موسيقي

9783642165436

موضوع مستند نشده

Combinatorial optimization.

موضوع مستند نشده

Natural computation.

موضوع مستند نشده

Combinatorial optimization.

موضوع مستند نشده

Informatique.

موضوع مستند نشده

Natural computation.

موضوع مستند نشده

COM051300

موضوع مستند نشده

PBU

موضوع مستند نشده

UMB

شماره

ويراست

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Neumann, Frank, (Computer scientist)

مستند نام اشخاص تاييد نشده

Witt, Carsten.

تاريخ عمليات

20201203205557.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y