Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2001.08537
Cited By
v1
v2
v3 (latest)
Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees
Operational Research (OR), 2020
23 January 2020
Yongchun Li
Weijun Xie
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees"
3 / 3 papers shown
The Augmented Factorization Bound for Maximum-Entropy Sampling
Conference on Integer Programming and Combinatorial Optimization (IPCO), 2024
Yongchun Li
122
5
0
14 Oct 2024
Convex relaxation for the generalized maximum-entropy sampling problem
Gabriel Ponte
M. Fampa
Jon Lee
202
6
0
01 Apr 2024
Variable Selection for Kernel Two-Sample Tests
Jie Wang
Santanu S. Dey
Yao Xie
385
6
0
15 Feb 2023
1
Page 1 of 1
