Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

William W. Li, C. F.Jeff Wu

Research output: Contribution to journalArticlepeer-review

138 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)171-179
Number of pages9
Issue number2
StatePublished - May 1997

Bibliographical note

Funding Information:
We thank the associate editor and a referee for helpful comments. This researchw as supported by the Natural Sciences and Engineering Council of Canada at the Univer-sitv of Waterloo and the National Science Foundation grant DI& 9404300.


  • CP algorithm
  • D-optima1 design
  • k-exchange algorithm

Fingerprint Dive into the research topics of 'Columnwise-pairwise algorithms with applications to the construction of supersaturated designs'. Together they form a unique fingerprint.

Cite this