Bounds for short covering codes and reactive tabu search
DOI10.1016/J.DAM.2009.11.006zbMATH Open1186.94484OpenAlexW2148242129MaRDI QIDQ968171FDOQ968171
Authors: Marcus Poggi, Carlos F. O. Mendes, Emerson L. Monte Carmelo 
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
Recommendations
- scientific article; zbMATH DE number 825138
- scientific article; zbMATH DE number 1229706
- Upper bounds for covering arrays by tabu search.
- scientific article; zbMATH DE number 177895
- Exact bounds on the sizes of covering codes
- On lower bounds for covering codes
- Covering bounds for codes
- Linear programming bounds for codes via a covering argument
- Bounds on covering codes in RT spaces using ordered covering arrays
- scientific article; zbMATH DE number 2148773
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)
Cites Work
- Title not available (Why is that?)
- Tabu Search—Part I
- Title not available (Why is that?)
- Tabu Search—Part II
- Title not available (Why is that?)
- Tabu search variants for the mix fleet vehicle routing problem
- The Reactive Tabu Search
- A note on bounds for q-ary covering codes
- On the covering radius of small codes
- Title not available (Why is that?)
- On covering and coloring problems for rook domains
- Short coverings in tridimensional spaces arising from sum-free sets
- Title not available (Why is that?)
- Upper bounds for q-ary covering codes
- Lower bounds on covering codes via partition matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
- Toroidal boards and code covering
- A covering problem over finite rings
- Short covering codes arising from matchings in weighted graphs
- Sharp covering of a module by cyclic submodules
- Short coverings and matching in weighted graphs
This page was built for publication: Bounds for short covering codes and reactive tabu search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968171)
