Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening

arXiv (Cornell University)（2023）

引用 0|浏览7

暂无评分

摘要

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.

查看译文

关键词

fast local search,branch-and-bound,d-optimality,variable-bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要