Local search in coding theory

E.H.L. Aarts; P.J.M. Laarhoven, van

doi:10.1016/0012-365X(92)90524-J

Local search in coding theory

E.H.L. Aarts, P.J.M. Laarhoven, van

Research output: Contribution to journal › Article › Academic › peer-review

12 Citations (Scopus)

Abstract

We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large.

Original language	English
Pages (from-to)	11-18
Number of pages	8
Journal	Discrete Mathematics
Volume	106/107
Issue number	1
DOIs	https://doi.org/10.1016/0012-365X(92)90524-J
Publication status	Published - 1992

Access to Document

10.1016/0012-365X(92)90524-J

Cite this

@article{bb623de9ce73422ba38070473b94746f,

title = "Local search in coding theory",

abstract = "We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large.",

author = "E.H.L. Aarts and {Laarhoven, van}, P.J.M.",

year = "1992",

doi = "10.1016/0012-365X(92)90524-J",

language = "English",

volume = "106/107",

pages = "11--18",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Local search in coding theory

AU - Aarts, E.H.L.

AU - Laarhoven, van, P.J.M.

PY - 1992

Y1 - 1992

N2 - We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large.

AB - We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large.

U2 - 10.1016/0012-365X(92)90524-J

DO - 10.1016/0012-365X(92)90524-J

M3 - Article

SN - 0012-365X

VL - 106/107

SP - 11

EP - 18

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Local search in coding theory

Abstract

Access to Document

Fingerprint

Cite this