A branch-and-bound algorithm for the exact optimal experimental design problem.
Selin Damla AhipasaogluPublished in: Stat. Comput. (2021)
Keyphrases
- branch and bound algorithm
- experimental design
- optimal solution
- lower bound
- branch and bound
- upper bound
- np hard
- lower bounding
- active learning
- upper bounding
- combinatorial optimization
- experimental designs
- empirical studies
- sample size
- single machine scheduling problem
- worst case
- feature selection
- precedence constraints
- mixed integer linear programming
- special case
- computational complexity
- finding an optimal solution
- video games
- dynamic programming
- learning processes
- search space
- exact methods
- objective function
- learning algorithm