Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 发表日期：

    2025年3月13日

查看全文
  • Gabriel Ponte,
  • Marcia Fampa,
  • Jon Lee

摘要

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.