Columnwise-Pairwise Algorithms With Applications to the Construction of Supersaturated Designs

Abstract

Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 196 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.