Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees
From MaRDI portal
Publication:6579643
DOI10.1287/opre.2023.2488MaRDI QIDQ6579643
Publication date: 25 July 2024
Published in: Operations Research (Search for Journal in Brave)
A-optimalitylocal search algorithmsampling algorithmmachine learning and data scienceconvex integer programmaximum entropy sampling problem
Related Items (1)
This page was built for publication: Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees