Pages that link to "Item:Q1765237"
From MaRDI portal
The following pages link to Optimal covering designs: complexity results and new bounds (Q1765237):
Displaying 9 items.
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- General upper bounds on the minimum size of covering designs (Q1291117) (← links)
- Bounds for optimal coverings (Q2741467) (← links)
- Upper bounds on the general covering number<i>C</i><sub>λ</sub>(<i>v</i>,<i>k</i>,<i>t</i>,<i>m</i>) (Q3156929) (← links)
- New upper bounds on the minimum size of covering designs (Q4222173) (← links)
- (Q4502642) (← links)
- Asymptotic Bounds for General Covering Designs (Q5175786) (← links)