scientific article; zbMATH DE number 1229706

DOI10.1002/(SICI)1520-6610(1997)5:1%3C71::AID-JCD6%3E3.0.CO;2-VMaRDI QIDQ4222145zbMATH OpenFDO

Authors Patric R. J. Östergård

Publication date 6 December 1998

Full work available at URL https://doi.org/10.1002/(SICI)1520-6610(1997)5:1%3C71::AID-JCD6%3E3.0.CO;2-V

zbMATH Keywords

covering codeslocal searchsimulated annealingtabu search

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Graph domination, tabu search and the football pool problem
• Constructing covering codes with given automorphisms
• scientific article; zbMATH DE number 825138
• Bounds for short covering codes and reactive tabu search

Cited in

(11)

• Graph domination, tabu search and the football pool problem
• Ternary covering codes derived from BCH codes
• New upper bounds for binary covering codes
• Modelling constant weight codes using tabu search
• \(K_{5}(7,3) \leqslant 100\).
• An improved upper bound for the football pool problem for nine matches
• Solving LPN Using Covering Codes
• New coverings oft-sets with (t + 1)-sets
• scientific article; zbMATH DE number 520162 (Why is no real title available?)
• Constructing difference families through an optimization approach: Six new BIBDs
• Bounds for short covering codes and reactive tabu search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222145)