An Exact Algorithm for Maximum Entropy Sampling

DOI10.1287/opre.43.4.684zbMath0857.90069OpenAlexW2098642746MaRDI QIDQ4897080

Maurice Queyranne, Jon Lee, Chun Wa Ko

Publication date: 11 March 1997

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

Full work available at URL: https://doi.org/10.1287/opre.43.4.684

zbMATH Keywords

entropybranch-and-bound algorithmNP-hardexperimental designenvironmental monitoringeigenvalue interlacing propertyestimated covariance matricesmost informative subset

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Related Items (32)

Generalized maximum-entropy sampling ⋮ Spatial sampling design for parameter estimation of the covariance function ⋮ Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Solving maximum-entropy sampling problems using factored masks ⋮ The Power of Subsampling in Submodular Maximization ⋮ Spatial Sampling for Non‐compact Patterns ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An exact solution approach for the mobile multi‐agent sensing problem ⋮ An outer-approximation approach for information-maximizing sensor selection ⋮ A note on maximizing a submodular set function subject to a knapsack constraint ⋮ An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data ⋮ Efficient Solution of Maximum-Entropy Sampling Problems ⋮ Systems of Gaussian process models for directed chains of solvers ⋮ Continuous relaxations for Constrained Maximum-Entropy Sampling ⋮ Unnamed Item ⋮ On maximizing a monotone \(k\)-submodular function subject to a matroid constraint ⋮ Maximum-entropy sampling and the Boolean quadric polytope ⋮ Maximum-entropy remote sampling ⋮ Sensor selection for random field estimation in wireless sensor networks ⋮ Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model ⋮ Mercer Kernels and Integrated Variance Experimental Design: Connections Between Gaussian Process Regression and Polynomial Approximation ⋮ Information gathering in Bayesian networks applied to petroleum prospecting ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Approximately optimal subset selection for statistical design and modelling ⋮ Maximization of submodular functions: theory and enumeration algorithms ⋮ Optimal Off-line Experimentation for Games ⋮ k-Submodular maximization with two kinds of constraints ⋮ Maximum expected entropy transformed Latin hypercube designs ⋮ Unnamed Item ⋮ Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics

Uses Software

• EISPACK

This page was built for publication: An Exact Algorithm for Maximum Entropy Sampling