Mixing Convex-Optimization Bounds for Maximum-Entropy Sampling
Published in Mathematical Programming, 2021
This paper introduces novel convex-optimization bounds for the maximum-entropy sampling problem, providing tighter relaxations and improved computational efficiency.
Recommended citation: Zhongzhu Chen, Marcia Fampa, Amélie Lambert, and Jon Lee. (2021). "Mixing Convex-Optimization Bounds for Maximum-Entropy Sampling." Mathematical Programming.
Download Paper