Pages that link to "Item:Q1186280"
From MaRDI portal
The following pages link to On the best case performance of hit and run methods for detecting necessary constraints (Q1186280):
Displayed 6 items.
- Optimal strategy of coupon subset collection when each package contains half of the coupons (Q402372) (← links)
- On the best case performance of hit and run methods for detecting necessary constraints (Q1186280) (← links)
- Minimal representation of convex regions defined by analytic functions (Q1577971) (← links)
- Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings (Q2032148) (← links)
- Probabilistic algorithms for extreme point identification (Q3508860) (← links)
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints (Q4674254) (← links)