An Algorithmic Approach to Constructing Supersaturated Designs

1996/02/01 by Nam-Ky Nguyen, Nam‐Ky Nguyen · 132 citations
Computer Science · Decision Sciences · Engineering · Mathematics · #Advanced Multi-Objective Optimization Algorithms #Algorithm #Block (permutation group theory) #Combinatorics #Computer science #Generalization #Manufacturing Process and Optimization #Mathematical optimization #Mathematics #Optimal Experimental Design Methods #Theoretical computer science

paper · doi:10.1080/00401706.1996.10484417

published in Technometrics 38(1), 69-73 (Taylor & Francis)

openalex publication_date 1996/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

Supersaturated designs are very cost-effective to scientists and engineers at the primary stage of scientific investigation. This article describes a method of constructing supersaturated designs from balanced incomplete block designs that is a generalization of the method of Lin for constructing these designs and a more general approach to constructing these designs.

Cited by

• Grouped Latin Hypercube Designs with Controlled Correlations
• Majorization framework for balanced lattice designs
• Construction of optimal multi-level supersaturated designs
• Construction of E(s2)-optimal supersaturated designs

Related

• A New Class of Supersaturated Designs
• On the E(s²)-optimality of two-level supersaturated designs constructed using Wu's method of partially aliased interactions on certain two-level orthogonal arrays
• A bit-parallel tabu search algorithm for finding E(s²)-optimal and minimax-optimal supersaturated designs
• On The Construction And Evaluation Of Nine-Treatment Incomplete-Block Designs Of Order Three From Some Quasi-Semi-Latin Squares
• Balanced incomplete block designs and exact satisfiability