Constrained maximum-entropy sampling
From MaRDI portal
Cited in
(18)- Maximization of submodular functions: theory and enumeration algorithms
- A note on maximizing a submodular set function subject to a knapsack constraint
- 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
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Nonsmooth optimization via quasi-Newton methods
- Efficient solution of maximum-entropy sampling problems
- Maximum expected entropy transformed Latin hypercube designs
- Generalized maximum-entropy sampling
- Maximum-entropy remote sampling
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Convex relaxation for the generalized maximum-entropy sampling problem
- Generalized scaling for the constrained maximum-entropy sampling problem
- Sparse graphical designs via linear programming
- Solving maximum-entropy sampling problems using factored masks
This page was built for publication: Constrained maximum-entropy sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781107)