Pages that link to "Item:Q1123120"

The following pages link to A new approach to the analysis of random methods for detecting necessary linear inequality constraints (Q1123120):

Displaying 4 items.

• Optimal strategy of coupon subset collection when each package contains half of the coupons (Q402372) (← links)
• Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) (← links)
• On the best case performance of hit and run methods for detecting necessary constraints (Q1186280) (← links)
• Shake-and-bake algorithms for the identification of nonredundant linear inequalities (Q3978340) (← links)