The augmented factorization bound for maximum-entropy sampling
From MaRDI portal
Cites work
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- D-Optimal Data Fusion: Exact and Approximation Algorithms
- Efficient solution of maximum-entropy sampling problems
- Exponential inapproximability of selecting a maximum volume sub-matrix
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 806801 (Why is no real title available?)
- scientific article; zbMATH DE number 5206511 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Maximum Entropy Sampling and Optimal Bayesian Experimental Design
- Maximum-entropy remote sampling
- Maximum-entropy sampling and the Boolean quadric polytope
- Mixing convex-optimization bounds for maximum-entropy sampling
- On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
- Optimal monitoring network designs
- Randomized rounding for the largest simplex problem
- Schur convex functions on the spectra of graphs
- Solving maximum-entropy sampling problems using factored masks
- Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
This page was built for publication: The augmented factorization bound for maximum-entropy sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880116)
