scientific article; zbMATH DE number 1229706
From MaRDI portal
Publication:4222145
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1997)5:1<71::AID-JCD6>3.0.CO;2-V" /><71::AID-JCD6>3.0.CO;2-V 10.1002/(SICI)1520-6610(1997)5:1<71::AID-JCD6>3.0.CO;2-VzbMath0911.90284MaRDI QIDQ4222145
Publication date: 6 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (8)
An improved upper bound for the football pool problem for nine matches ⋮ Graph domination, tabu search and the football pool problem ⋮ Ternary covering codes derived from BCH codes ⋮ New upper bounds for binary covering codes ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ Constructing difference families through an optimization approach: Six new BIBDs ⋮ Bounds for short covering codes and reactive tabu search ⋮ New coverings oft-sets with (t + 1)-sets
This page was built for publication:
