Title
Complete enumeration of pure-level and mixed-level orthogonal arrays Complete enumeration of pure-level and mixed-level orthogonal arrays
Author
Faculty/Department
Faculty of Applied Economics
Publication type
article
Publication
New York :Wiley-Interscience ,
Subject
Mathematics
Source (journal)
Journal of combinatorial designs. - New York
Volume/pages
18(2010) :2 , p. 123-140
ISSN
1063-8539
ISI
000275030700005
Carrier
E
Target language
English (eng)
Full text (Publishers DOI)
Affiliation
University of Antwerp
Abstract
We specify an algorithm to enumerate a minimum complete set of combinatorially non-isomorphic orthogonal arrays of given strength t, run-size N, and level-numbers of the factors. The algorithm is the first one handling general mixed-level and pure-level cases. Using an implementation in C, we generate most non-trivial series for t=2, N28, t=3, N64, and t=4, N168. The exceptions define limiting run-sizes for which the algorithm returns complete sets in a reasonable amount of time.
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000275030700005&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000275030700005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000275030700005&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
Handle