A genetic algorithm for Lennard-Jones atomic clusters

dc.contributor.author	Barron, C
dc.contributor.author	Gomez, S
dc.contributor.author	Romero, D
dc.contributor.author	Saavedra, A
dc.date.accessioned	2011-01-22T10:27:39Z
dc.date.available	2011-01-22T10:27:39Z
dc.date.issued	1999
dc.identifier.issn	0893-9659
dc.identifier.uri	http://hdl.handle.net/11154/2636
dc.description.abstract	In regard to the problem of determining minimum L-J configurations for clusters of n atoms, we present here a genetic algorithm able to reproduce all best-known solutions in the 13 < n < 147 size range. These include not only the classical structures adhering to the icosahedral-growth, but also seven icosahedral structures with incomplete core, six more following the Marks decahedron geometry, and the unique (n = 38) face-centered cubic configuration that has been found in this range. (C) 1999 Elsevier Science Ltd. All rights reserved.	en_US
dc.language.iso	en	en_US
dc.title	A genetic algorithm for Lennard-Jones atomic clusters	en_US
dc.type	Article	en_US
dc.identifier.idprometeo	2657
dc.source.novolpages	12(7):85-90
dc.subject.wos	Mathematics, Applied
dc.description.index	WoS: SCI, SSCI o AHCI
dc.subject.keywords	atomic cluster
dc.subject.keywords	Lennard-Jones
dc.subject.keywords	genetic algorithm
dc.subject.keywords	global optimization
dc.relation.journal	Applied Mathematics Letters