Optimal multi-level supersaturated designs through integer programming
From MaRDI portal
Recommendations
- On multi-level supersaturated designs
- Optimal multi-level supersaturated designs constructed from linear and quadratic functions
- On the construction of multi-level supersaturated designs
- Construction of optimal multi-level supersaturated designs
- Some combinatorial constructions for optimal mixed-level supersaturated designs
Cites work
- scientific article; zbMATH DE number 2149825 (Why is no real title available?)
- A counterexample to Beder's conjectures about Hadamard matrices
- A mathematical programming approach to the construction of BIBDs
- A method for constructing supersaturated designs and its Es2 optimality
- A new method of construction of multi-level supersaturated designs.
- A systematical procedure in the construction of multi-level supersaturated design.
- Computer aided construction of efficient multi-level supersaturated designs
- Construction of efficient multi-level \(k\)-circulant supersaturated designs
- Construction of multi-level supersaturated design via Kronecker product
- Construction of optimal multi-level supersaturated designs
- Construction of supersaturated designs through partially aliased interactions
- Construction of three-level supersaturated design
- Generating and improving orthogonal designs by using mixed integer programming
- On multi-level supersaturated designs
- On the construction of multi-level supersaturated designs
- Optimal mixed-level supersaturated design
- Optimal multi-level supersaturated designs constructed from linear and quadratic functions
- Some Systematic Supersaturated Designs
- Tabu Search and Perturbation Methods in the Construction of Supersaturated Designs
- Three-level supersaturated designs
Cited in
(7)- Finding MDS-optimal supersaturated designs using computer searches
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- Cyclic circular balanced and strongly balanced crossover designs through integer programming
- Upper bound on the number of multi-level columns in equally replicated optimal designs minimizing the \(E(f_{NOD})\) criterion
- Optimal mixed-level supersaturated design with general number of runs
- Supersaturated designs with the maximum number of factors for a given resolution-rank
This page was built for publication: Optimal multi-level supersaturated designs through integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444395)