- Record: found
- Abstract: found
- Article: found
Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening
Preprint
31 August 2023
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
We develop a branch-and-bound algorithm for the integer D-optimality problem, a central problem in statistical design theory, based on two convex relaxations, employing variable-bound tightening and fast local-search procedures, testing our ideas on randomly-generated test problems.