Pages that link to "Item:Q4222145"
From MaRDI portal
The following pages link to Constructing covering codes by tabu search (Q4222145):
Displaying 11 items.
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- Graph domination, tabu search and the football pool problem (Q1356502) (← links)
- Ternary covering codes derived from BCH codes (Q1374190) (← links)
- New upper bounds for binary covering codes (Q1377844) (← links)
- Modelling constant weight codes using tabu search (Q1384374) (← links)
- \(K_{5}(7,3) \leqslant 100\). (Q1421340) (← links)
- An improved upper bound for the football pool problem for nine matches (Q1873825) (← links)
- Solving LPN Using Covering Codes (Q2938835) (← links)
- New coverings oft-sets with (t + 1)-sets (Q4242743) (← links)
- (Q4284025) (← links)
- Constructing difference families through an optimization approach: Six new BIBDs (Q4500696) (← links)