An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays (Q1023902): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.csda.2008.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073498984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Systematic Supersaturated Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3276963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mixed-level \(k\)-circulant supersaturated designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mixed-level supersaturated design with general number of runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform supersaturated design and its construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of minimum generalized aberration designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal mixed-level supersaturated design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of optimal supersaturated designs by the packing method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial constructions for optimal supersaturated designs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4662342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on resolvable incomplete block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3600729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A systematical procedure in the construction of multi-level supersaturated design. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated design with more than two levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach in constructing orthogonal and nearly orthogonal arrays. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Optimal Block Designs by Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Construction of Near-Orthogonal Arrays with Mixed Levels and Economic Run Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: New 3-level response surface designs constructed from incomplete block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of some exchange algorithms for constructing discrete \(D\)-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Orthogonal Arrays with Mixed Levels and Small Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of supersaturated designs through partially aliased interactions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:37, 1 July 2024

scientific article
Language Label Description Also known as
English
An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays
scientific article

    Statements

    An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays (English)
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references