Introduction and Basic Concepts
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”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cotta, C., Neri, F. (2012). Memetic Algorithms in Continuous Optimization. In: Neri, F., Cotta, C., Moscato, P. (eds) Handbook of Memetic Algorithms. Studies in Computational Intelligence, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23247-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-23247-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23246-6
Online ISBN: 978-3-642-23247-3
eBook Packages: EngineeringEngineering (R0)