Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Simulated annealing: A tool for operational research
A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
Variable neighbourhood search: Methods and applications
Orthogonal arrays. Theory and applications
A variable neighborhood search for graph coloring.
Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
Minimum \(G_2\)-aberration for nonregular fractional factorial designs
Minimum \(G_{2}\)-aberration properties of two-level foldover designs
Results for two-level fractional factorial designs of resolution IV or more
A comparison of design and model selection methods for supersaturated experiments
Complete enumeration of pure-level and mixed-level orthogonal arrays
Optimal Blocking Schemes for 2 n and 2 n-p Designs
Using the Folded-Over 12-Run Plackett—Burman Design to Consider Interactions
A Catalogue of Two-Level and Three-Level Fractional Factorial Designs with Small Runs
Some nonregular designs from the Nordstrom–Robinson code and their statistical properties
Variable neighborhood search: Principles and applications
Two-level designs of strength 3 and up to 48 runs

This page was built for publication: Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays