Graphical methods for order-of-addition experiments
From MaRDI portal
Cites work
- A Component-Position Model, Analysis and Design for Order-of-Addition Experiments
- A mapping-based universal kriging model for order-of-addition experiments in drug combination studies
- An algorithm for optimal designs on a design space
- Construction of optimal fractional Order-of-Addition designs via block designs
- D-optimal designs via a cocktail algorithm
- Design of order-of-addition experiments
- scientific article; zbMATH DE number 3945143 (Why is no real title available?)
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Metaheuristic Solutions to Order-of-Addition Design Problems
- Monotonic convergence of a general algorithm for computing optimal designs
- On the generation of all topological sortings
- Optimal designs for order-of-addition experiments
- Single Machine Job Sequencing with Precedence Constraints
- Ta algorithms for D-optimal OofA mixture designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- The Equivalence of Two Extremum Problems
- TSPLIB—A Traveling Salesman Problem Library
This page was built for publication: Graphical methods for order-of-addition experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898568)