• Publications
  • Influence
An Exact Algorithm for Maximum Entropy Sampling
We study the experimental design problem of selecting a most informative subset, having prespecified size, from a set of correlated random variables. The problem arises in many applied domains, suchExpand
  • 276
  • 33
The volume of relaxed Boolean-quadric and cut polytopes
For n ⩾ 2, the boolean quadric polytope Pn is the convex hull in d:=(n+12) dimensions of the binary solutions xixj = yij, for all i < j in N ≔ 1,2,. …,n. The polytope is naturally modeled by aExpand
  • 16
  • Open Access
Comparison of Spectral and Hadamard Bounds for D-Optimality
We introduce a spectral bound for D-optimal design problems, based on singular values. We compare the spectral bound to a bound based on Hadamard’s inequality which was introduced by Welch. InExpand
  • 2
  • Open Access
The Volume of the Relaxed Boolean Quadric Polytope
The boolean quadric polytope Pn is the convex hull in d:= (n;l) dimensions of the binary solutions of XiXj = Yij, for all i