zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity. (English) Zbl 1223.68002
Natural Computing Series. Berlin: Springer (ISBN 978-3-642-16543-6/hbk; 978-3-642-16544-3/ebook). xii, 216 p. EUR 79.95/net; SFR 115.00; £ 72.00; $ 99.00 (2010).
Biologically inspired algorithms such as evolutionary algorithms and ant colony optimization have found numerous applications for solving problems from computational biology, engineering, logistics, and telecommunications. Many problems arising in these application domains belong to the field of combinatorial optimization. Bio-inspired algorithms have achieved success when applied to such problems in recent years. In contrast to many successful applications of bio-inspired algorithms, the theoretical foundation of these algorithms lags far behind their practical success. This is mainly due to the fact that these algorithms make use of random decisions in different modules. This leads to stochastic processes that are hard to analyze. This book treats bio-inspired computing methods as stochastic algorithms and presents rigorous results on their runtime behavior. The book is meant to give researchers a state-of-the-art presentation of theoretical results on bio-inspired computing methods in the context of combinatorial optimization. It can be used as basic material for courses on bio-inspired computing that are meant for graduate students and advanced undergraduates. The book is organized in three parts. It starts with a general introduction to bio-inspired algorithms and their computational complexity. Later on, different methods that have been developed in recent years, are presented in a comprehensive manner. Then, some of the major results that have been achieved in the field of single-objective optimization are presented. Different problems such as minimum spanning trees, maximum matchings, and the computation of shortest paths are considered. After these studies, classical multi-objective optimization topics such as the classical computation of multi-objective minimum spanning trees are studied and it is shown that multi-objective approaches can lead to provably better algorithms for classical single-objective problems. The book is recommended as basic material for a course on theoretical aspects of bio-inspired computing.

MSC:
68-02Research monographs (computer science)
68W05Nonnumerical algorithms
68Q25Analysis of algorithms and problem complexity
68P10Searching and sorting
90C27Combinatorial optimization
WorldCat.org
Full Text: DOI