Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913493376040960 |
|---|---|
| author | Ponte, Gabriel Fampa, Marcia Lee, Jon |
| author_facet | Ponte, Gabriel Fampa, Marcia Lee, Jon |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_00117 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening Ponte, Gabriel Fampa, Marcia Lee, Jon Optimization and Control 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. |
| title | Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2309.00117 |