New extended-variable relaxations are derived for CGMESP that generalize prior bounds for CMESP and binary D-optimality and are tested numerically inside branch-and-bound.
Proceedings of STOC 2015 (Forty-Seventh Annual ACM Symposium on Theory of Computing) , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extended-variable relaxations for the constrained generalized maximum-entropy sampling problem
New extended-variable relaxations are derived for CGMESP that generalize prior bounds for CMESP and binary D-optimality and are tested numerically inside branch-and-bound.