Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFOR: Information Systems and Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
