A Tabu Search algorithm for difference triangle sets and Golomb rulers
Computers and Operations Research
Equivalence of some LP-based lower bounds for the Golomb ruler problem
Discrete Applied Mathematics
Statistical Weakness of Multiplexed Sequences
Finite Fields and Their Applications
| Hi-index | 754.84 |
Difference triangle sets have a number of applications in telecommunications. The authors describe a linear programming model for finding improved lower bounds on the size of such sets. Two integer linear programming formulations for finding minimal difference triangle sets are presented. The linear programming relaxation of the second formulation is strengthened with a family of valid inequalities and solved to yield improved lower bounds. Numerical results for selected difference triangle sets are given