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 various test problems.
@article{arxiv.2309.00117,
title = {Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening},
author = {Gabriel Ponte and Marcia Fampa and Jon Lee},
journal= {arXiv preprint arXiv:2309.00117},
year = {2024}
}