Order-of-addition experiments for sequential adjacency relationship problems
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
- A new method of finding component orthogonal arrays for order-of-addition experiments
- A Position-Based Approach for Design and Analysis of Order-of-Addition Experiments
- Construction of component orthogonal arrays with any number of components
- Design of agricultural field experiments accounting for both complex blocking structures and network effects
- Design of order-of-addition experiments
- Designs for order-of-addition experiments
- Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
- Genetic algorithms for the traveling salesman problem
- Implementing Quicksort programs
- Modeling and Active Learning for Experiments with Quantitative-Sequence Factors
- Optimal control of plotting and drilling machines: A case study
- Optimal Experimental Design
- Order-of-addition experiments: a review and some recommendations
- Order-of-addition modeling
- Order-of-addition orthogonal arrays to study the effect of treatment ordering
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Ordering factorial experiments
- Regression models for order‐of‐addition experiments
- Robust Design for Order-of-Addition Experiments
- TSPLIB—A Traveling Salesman Problem Library
This page was built for publication: Order-of-addition experiments for sequential adjacency relationship problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254803)
