Local search in coding theory (Q1199575): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3691573 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3785827 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3946078 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evolution algorithms in combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) / rank | |||
Normal rank | |||
Latest revision as of 16:19, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search in coding theory |
scientific article |
Statements
Local search in coding theory (English)
0 references
16 January 1993
0 references
This paper gives a brief survey of simulated annealing and genetic local search algorithms applied to covering and packing problems in coding theory.
0 references
simulated annealing
0 references
local search
0 references
covering
0 references
packing
0 references
