Adaptive Order-of-Addition Experiments via the Quick-Sort Algorithm

DOI10.1080/00401706.2023.2174601MaRDI QIDQ6631146zbMATH OpenFDO

Authors Dennis K. J. Lin, Jian-Bin Chen

Publication date 31 October 2024

Published in Technometrics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00401706.2023.2174601

Mathematics Subject Classification ID

Applications of statistics (62Pxx)

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 Position-Based Approach for Design and Analysis of Order-of-Addition Experiments
• Construction of optimal fractional Order-of-Addition designs via block designs
• Design of order-of-addition experiments
• Designs for order-of-addition experiments
• scientific article; zbMATH DE number 720689 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• Multi-pivot quicksort: theory and experiments
• On Ordering Problems: A Statistical Approach
• Optimal designs for order-of-addition experiments
• Order-of-addition modeling
• Quicksort
• Saturated and supersaturated order-of-addition designs
• Scheduling. Theory, algorithms, and systems

Cited in

(5)

• Optimal Designs for Order-of-Addition Two-Level Factorial Experiments
• Order-of-addition experiments: a review and some recommendations
• Order-of-addition experiments with order constraints
• Analysis of order-of-addition experiments
• Optimal Run Order for Order-of-Addition Experiments

This page was built for publication: Adaptive Order-of-Addition Experiments via the Quick-Sort Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631146)