On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem

DOI10.1287/ijoc.2022.1264arXiv2112.14291MaRDI QIDQ6203371

Zhongzhu Chen, Márcia H. C. Fampa, Jon Lee

Publication date: 28 February 2024

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.14291

zbMATH Keywords

convex relaxationmaximum-entropy samplinginteger nonlinear optimizationmixing bounds

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem