Exploring k-circulant supersaturated designs via genetic algorithms

Koukouvinos, C; Mylona, K; Simos, DE

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Mylona, K	en
dc.contributor.author	Simos, DE	en
dc.date.accessioned	2014-03-01T01:26:20Z
dc.date.available	2014-03-01T01:26:20Z
dc.date.issued	2007	en
dc.identifier.issn	0167-9473	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/18021
dc.subject	Cyclic generator	en
dc.subject	E (s2)-optimality	en
dc.subject	Factorial designs	en
dc.subject	Genetic algorithms	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Statistics & Probability	en
dc.subject.other	Optimization	en
dc.subject.other	Statistical methods	en
dc.subject.other	Cyclic generator	en
dc.subject.other	Factorial designs	en
dc.subject.other	Supersaturated designs	en
dc.subject.other	Genetic algorithms	en
dc.title	Exploring k-circulant supersaturated designs via genetic algorithms	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.csda.2006.11.042	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.csda.2006.11.042	en
heal.language	English	en
heal.publicationDate	2007	en
heal.abstract	E(s(2))-optimal or near optimal, two level k-circulant supersaturated designs are explored by means of genetic algorithms. All known k-circulant classes for k = 2,..., 6 have been rebuilt and improved. The successful application of genetic algorithms is further illustrated by the construction of several k-circulant supersaturated designs for k = 7, 8. (c) 2006 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computational Statistics and Data Analysis	en
dc.identifier.doi	10.1016/j.csda.2006.11.042	en
dc.identifier.isi	ISI:000244630500016	en
dc.identifier.volume	51	en
dc.identifier.issue	6	en
dc.identifier.spage	2958	en
dc.identifier.epage	2968	en