Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds

References

• Al-Thani H, Lee J (2020a) An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. SN Oper. Res. Forum 1(3):Article 17.Google Scholar
• Al-Thani H, Lee J (2020b) MESgenCov. Accessed June 14, 2022, https://github.com/hessakh/MESgenCov.Google Scholar
• Anstreicher KM (2018) Maximum-entropy sampling and the Boolean quadric polytope. J. Global Optim. 72(4):603–618.Crossref, Google Scholar
• Anstreicher KM (2020) Efficient solution of maximum-entropy sampling problems. Oper. Res. 68(6):1826–1835.Link, Google Scholar
• Anstreicher KM, Lee J (2004) A masked spectral bound for maximum-entropy sampling. mODa 7—Advances in Model-Oriented Design and Analysis, Contributions to Statistics (Physica, Heidelberg, Germany), 1–12.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1996) Continuous relaxations for constrained maximum-entropy sampling. IPCO, vol. 1084 of Lecture Notes in Computer Science (Springer, Berlin), 234–248.Crossref, Google Scholar
• Anstreicher KM, Fampa M, Lee J, Williams J (1999) Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Math. Programming Ser. A 85(2):221–240.Crossref, Google Scholar
• Burer S, Lee J (2007) Solving maximum-entropy sampling problems using factored masks. Math. Programming Ser. B 109(2–3):263–281.Crossref, Google Scholar
• Chen Z, Fampa M, Lambert A, Lee J (2021) Mixing convex-optimization bounds for maximum-entropy sampling. Math. Programming Ser. B 188:539–568.Crossref, Google Scholar
• Hoffman A, Lee J, Williams J (2001) New upper bounds for maximum-entropy sampling. mODa 6—Advances in Model-Oriented Design and Analysis, Contributions to Statistics (Physica, Heidelberg, Germany), 143–153.Crossref, Google Scholar
• Horn RA, Johnson CR (2012) Matrix Analysis (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ko C-W, Lee J, Queyranne M (1995) An exact algorithm for maximum entropy sampling. Oper. Res. 43(4):684–691.Link, Google Scholar
• Lee J (1998) Constrained maximum-entropy sampling. Oper. Res. 46(5):655–664.Link, Google Scholar
• Lee J, Williams J (2003) A linear integer programming bound for maximum-entropy sampling. Math. Programming Ser. B 94(2–3):247–256.Crossref, Google Scholar
• NADP (2018) National acidic deposition program, National Trends Network. Accessed June 14, 2022, https://nadp.slh.wisc.edu/ntn/.Google Scholar
• Shewry MC, Wynn HP (1987) Maximum entropy sampling. J. Appl. Statist. 46:165–170.Crossref, Google Scholar
• Zidek JV, Sun W, Le ND (2000) Designing and integrating composite networks for monitoring multivariate Gaussian pollution fields. J. Royal Statist. Soc. Ser. C Appl. Statist. 49(1):63–79.Crossref, Google Scholar