An outer-approximation algorithm for maximum-entropy sampling

DOI10.1007/978-3-031-18530-4_10zbMath1528.90216MaRDI QIDQ6166896

Márcia H. C. Fampa, Jon Lee

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

outer approximationmixed-integer nonlinear optimizationdisjunctive cutsmaximum-entropy samplingno-good

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

An outer-approximation algorithm for maximum-entropy sampling

Cites Work

• Solving maximum-entropy sampling problems using factored masks
• Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
• Solving mixed integer nonlinear programs by outer approximation
• A linear integer programming bound for maximum-entropy sampling
• Maximum-entropy sampling and the Boolean quadric polytope
• An outer-approximation approach for information-maximizing sensor selection
• Mixing convex-optimization bounds for maximum-entropy sampling
• An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
• Constrained Maximum-Entropy Sampling
• Randomized Rounding for the Largest Simplex Problem
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Disjunctive Programming
• An Exact Algorithm for Maximum Entropy Sampling
• Efficient Solution of Maximum-Entropy Sampling Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An outer-approximation algorithm for maximum-entropy sampling