Join Books.org — it's free

Genetics - General and Miscellaneous, Computer Mathematics, Mathematical Programming & Operations Research, Evolutionary Computation & Genetic Algorithms
Foundations of Generic Optimization: Volume 1: A Combinatorial Approach to Epistasis by Iglesias, M. , Naudts, B. , Verschoren, A. β€” book cover

Foundations of Generic Optimization: Volume 1: A Combinatorial Approach to Epistasis

by Iglesias, M., Naudts, B., Verschoren, A.
Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Log in to track your reading progress.

Overview

The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way.

In particular, it contains a refresher on the linear algebra used in the text as well as an elementary introductory chapter on genetic algorithms aimed at readers unacquainted with this notion.

In this way, the monograph aims to serve a broad audience consisting of graduate and advanced undergraduate students in mathematics and computer science, as well as researchers working in the domains of optimization, artificial intelligence, theoretical computer science, combinatorics and evolutionary algorithms.

Synopsis

The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way. In particular, it contains a refresher on the linear algebra used in the text as well as an elementary introductory chapter on genetic algorithms aimed at readers unacquainted with this notion. In this way, the monograph aims to serve a broad audience consisting of graduate and advanced undergraduate students in mathematics and computer science, as well as researchers working in the domains of optimization, artificial intelligence, theoretical computer science, combinatorics and evolutionary algorithms.

Reviews

There are no reviews yet. Log in to write one.

Book Details

Published
January 11, 2011
Publisher
Springer-Verlag New York, LLC
Pages
312
Format
Paperback
ISBN
9789048169221

Similar books