Generalized maximum-entropy sampling
From MaRDI portal
Publication:5882388
DOI10.1080/03155986.2018.1533774OpenAlexW2915516423MaRDI QIDQ5882388
No author found.
Publication date: 15 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2018.1533774
Related Items (1)
Cites Work
- Solving maximum-entropy sampling problems using factored masks
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- On analyticity of functions involving eigenvalues
- A linear integer programming bound for maximum-entropy sampling
- Constrained Maximum-Entropy Sampling
- Techniques for Submodular Maximization
- Matrix Analysis
- Derivatives and Perturbations of Eigenvectors
- Comparison of two approaches in the optimal design of an observation network
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Maximum-entropy remote sampling
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized maximum-entropy sampling