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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
Paper Title
Journal
Date
