Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds

DOI10.1287/OPRE.2022.2324MaRDI QIDQ6579649FDOQ6579649

Authors: Zhongzhu Chen, Marcia Fampa, Jon Lee 

Publication date: 25 July 2024

Published in: Operations Research (Search for Journal in Brave)

Recommendations

• Solving maximum-entropy sampling problems using factored masks
• Mixing convex-optimization bounds for maximum-entropy sampling
• Efficient solution of maximum-entropy sampling problems
• A linear integer programming bound for maximum-entropy sampling
• On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem

zbMATH Keywords

optimizationconvex relaxationsenvironmental monitoringdifferential entropynonlinear combinatorial optimizationnonlinear integer optimizationmaximum-entropy sampling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

This page was built for publication: Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579649)