By Topic

Application of linear programming to the optimal difference triangle set problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Lorentzen ; Norwegian Telecom, Kjeller, Norway ; R. Nilsen

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

Published in:

IEEE Transactions on Information Theory  (Volume:37 ,  Issue: 5 )