An outer-approximation algorithm for maximum-entropy sampling
From MaRDI portal
Recommendations
Cites work
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- An outer-approximation approach for information-maximizing sensor selection
- An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data
- Constrained maximum-entropy sampling
- Disjunctive cuts for mixed integer nonlinear programming problems
- Disjunctive programming
- Efficient solution of maximum-entropy sampling problems
- scientific article; zbMATH DE number 1534303 (Why is no real title available?)
- scientific article; zbMATH DE number 806801 (Why is no real title available?)
- Maximum-entropy sampling and the Boolean quadric polytope
- Mixing convex-optimization bounds for maximum-entropy sampling
- Randomized rounding for the largest simplex problem
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Solving maximum-entropy sampling problems using factored masks
- Solving mixed integer nonlinear programs by outer approximation
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Cited in
(3)
This page was built for publication: An outer-approximation algorithm for maximum-entropy sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166896)