Pages that link to "Item:Q2058883"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883):
Displaying 7 items.
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
- Mixed-integer linear programming for computing optimal experimental designs (Q6616196) (← links)
- <i>D</i>- and<i>A</i>-Optimal Screening Designs (Q6631157) (← links)
- The polytope of optimal approximate designs: extending the selection of informative experiments (Q6657821) (← links)