A linear integer programming bound for maximum-entropy sampling

DOI10.1007/s10107-002-0318-xzbMath1030.90063OpenAlexW1996992098MaRDI QIDQ1411612

Joy Williams, Jon Lee

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0318-x

zbMATH Keywords

dynamic programmingmatchingbranch-and-boundspectral boundFisher's inequalityexperimental design

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)

Related Items (11)

Generalized maximum-entropy sampling ⋮ Solving maximum-entropy sampling problems using factored masks ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation 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 ⋮ Efficient Solution of Maximum-Entropy Sampling Problems ⋮ Maximum-entropy sampling and the Boolean quadric polytope ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Approximately optimal subset selection for statistical design and modelling

This page was built for publication: A linear integer programming bound for maximum-entropy sampling