A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
DOI10.1016/j.jspi.2008.05.006zbMath1149.62065OpenAlexW2045865242MaRDI QIDQ958805
Dimitris E. Simos, Kalliopi Mylona, Christos Koukouvinos
Publication date: 8 December 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2008.05.006
metaheuristicssimulated annealinggenetic algorithmshybridfactorial designscyclic generatorsupersaturated designs\(E(s^{2})\)-optimality
Optimal statistical designs (62K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Factorial statistical designs (62K15)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Exploring \(k\)-circulant supersaturated designs via genetic algorithms
- Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs
- Construction of \(E(s^2)\)-optimal supersaturated designs
- \(E(s^{2})\)-optimal supersaturated designs with good minimax properties
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
- A General Method of Constructing E(s2)-Optimal Supersaturated Designs
- An Algorithmic Approach to Constructing Supersaturated Designs
- Another Look at First-Order Saturated Designs: The p-Efficient Designs
- Convergence of an annealing algorithm
- An Analysis for Unreplicated Fractional Factorials
- Some Systematic Supersaturated Designs
- A method for constructing supersaturated designs and its Es2 optimality
- Equation of State Calculations by Fast Computing Machines
- Screening
This page was built for publication: A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs