A Tabu Search algorithm for difference triangle sets and Golomb rulers

Authors:
Philippe Galinier;Brigitte Jaumard
Affiliations:
Département de génie informatique, Ecole Polytechnique de Montréal, C.P. 6079, succursale Centre-ville, Montréal, (Québec), Canada H3C 3A7;Département d'Informatique et de recherche opérationnelle, Université de Montréal, Pavillon André-Aisenstadt, 2920 chemin de la Tour, Montréal (Québec), Canada H ...
Venue:
Computers and Operations Research
Year:
2006

Citing 17
Cited 0

Golomb rectangles

IEEE Transactions on Information Theory
New Constructions of Disjoint Distinct Difference Sets

Designs, Codes and Cryptography
On lower bounds for numbered complete graphs

Proceedings of the third international conference on Graphs and optimization
Tabu Search

Tabu Search
Genetic Algorithm Approach to the Search for Golomb Rulers

Proceedings of the 6th International Conference on Genetic Algorithms
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Constructions for difference triangle sets

IEEE Transactions on Information Theory
Bounds and construction for difference triangle sets

IEEE Transactions on Information Theory
Bounds on the size of optimal difference triangle sets

IEEE Transactions on Information Theory
Some new disjoint Golomb rulers

IEEE Transactions on Information Theory
Some new optimum Golomb rulers

IEEE Transactions on Information Theory
Bounds and constructions of disjoint sets of distinct difference sets

IEEE Transactions on Information Theory
Difference triangle sets from affine planes

IEEE Transactions on Information Theory
A class of binary recurrent codes with limited error propagation

IEEE Transactions on Information Theory
Disjoint difference sets, difference triangle sets, and related codes

IEEE Transactions on Information Theory - Part 2
Application of linear programming to the optimal difference triangle set problem

IEEE Transactions on Information Theory
Further results on difference triangle sets

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a Tabu Search heuristic to design optimal Golomb rulers and Difference Triangle Sets. These two highly combinatorial problems have a number of applications in information transmission in telecommunications, and in particular in the construction of convolutional self-orthogonal codes. Our tabu algorithm obtains remarkable results and finds many Difference Triangle Sets with smaller spans than those obtained so far.