Local search in coding theory

DOI10.1016/0012-365X(92)90524-JzbMath0776.05030MaRDI QIDQ1199575

Peter J. M. Van Laarhoven, Emile H. L. Aarts

Publication date: 16 January 1993

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

zbMATH Keywords

coveringsimulated annealinglocal searchpacking

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (3)

Two new optimal ternary two-weight codes and strongly regular graphs ⋮ Metaheuristics: A bibliography ⋮ \(K_{5}(7,3) \leqslant 100\).

Cites Work

• Optimization by Simulated Annealing
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• Evolution algorithms in combinatorial optimization
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search in coding theory