Skip to main content
Journal Article

Memetic algorithms in continuous optimization

Studies in Computational Intelligence (2012) 379 121-134
DOI: 10.1007/978-3-642-23247-3_8
3Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain "holes". © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cotta, C., & Neri, F. (2012). Memetic algorithms in continuous optimization. Studies in Computational Intelligence, 379, 121–134. https://doi.org/10.1007/978-3-642-23247-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free