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

• 成果类型: Article
• 署名作者: Ponte, Gabriel; Fampa, Marcia; Lee, Jon
• 署名单位: Universidade Federal Rural do Rio de Janeiro (UFRRJ); Universidade Federal do Rio de Janeiro; University of Michigan System; University of Michigan
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610; 1436-4646
• DOI: 10.1007/s10107-025-02196-2
• 发表日期: 2026-07
• 页码: 337-374
• 关键词: D-optimality; LOCAL SEARCH; branch-and-bound; Variable-bound tightening; convex relaxation; MONITORING NETWORK; designs

摘要

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.