Pages that link to "Item:Q1302176"

The following pages link to Covering \(t\)-sets with \((t+2)\)-sets (Q1302176):

Displaying 11 items.

• A tabu search algorithm for the covering design problem (Q415558) (← links)
• Computational cost of the Fekete problem. I: The forces method on the 2-sphere (Q1017591) (← links)
• Covering \(t\)-element sets by partitions (Q1180794) (← links)
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\) (Q1182924) (← links)
• Small covering designs by branch-and-cut (Q1411610) (← links)
• Some \(t\)-designs are minimal \((t+1)\)-coverings (Q1584345) (← links)
• Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
• Generalized covering designs and clique coverings (Q3100732) (← links)
• Upper bounds on the general covering number<i>C</i>_λ(<i>v</i>,<i>k</i>,<i>t</i>,<i>m</i>) (Q3156929) (← links)
• New coverings oft-sets with (t + 1)-sets (Q4242743) (← links)
• New constructions for covering designs (Q4373370) (← links)