Bounds for short covering codes and reactive tabu search

DOI10.1016/j.dam.2009.11.006zbMath1186.94484OpenAlexW2148242129MaRDI QIDQ968171

Marcus Poggi, Emerson L. Monte Carmelo, Carlos F. O. Mendes

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.006

zbMATH Keywords

covering radiustabu searchfinite fielddominating setcovering code

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Bounds on codes (94B65) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items

A covering problem over finite rings ⋮ New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets ⋮ Short covering codes arising from matchings in weighted graphs ⋮ Sharp covering of a module by cyclic submodules ⋮ Toroidal boards and code covering ⋮ Short coverings and matching in weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on covering codes via partition matrices
• On covering and coloring problems for rook domains
• Short coverings in tridimensional spaces arising from sum-free sets
• Upper bounds for q-ary covering codes
• Tabu Search—Part I
• Tabu Search—Part II
• The Reactive Tabu Search
• On the covering radius of small codes
• Tabu search variants for the mix fleet vehicle routing problem
• A note on bounds for q-ary covering codes