We introduce the generalized constrained maximum-entropy sampling problem (GCMESP) as a common generalization of the ordinary constrained maximum-entropy sampling problem (CMESP) and the constrained D-optimality problem (CDOPTP). Exact algorithms for both CMESP and CDOPTP are based on branch-and-bound methods. We extend a spectral upper-bounding method for the CMESP to the GCMESP.
No takes yet. Share an insight, caveat, or question.
Lee et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: