Name
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90524-J | Discrete Mathematics |
Keywords | Field | DocType |
coding theory,local search | Combinatorics,Mathematical optimization,Combinatorial optimization problem,Packing problems,Coding (social sciences),Combinatorial optimization,Coding theory,Local search (optimization),Mathematics,Computation | Journal |
Volume | ISSN | Citations |
106-107, | Discrete Mathematics | 10 |
PageRank | References | Authors |
0.89 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emile H. L. Aarts | 1 | 1641 | 307.48 |
| Peter J. M. Van Laarhoven | 2 | 557 | 104.42 |