L Auslander, E Feig, et al.
Advances in Applied Mathematics
Paper
Improved LP lower bounds for difference triangle sets
Abstract
In 1991 Lorentzen and Nilsen showed how to use linear programming to prove lower bounds on the size of difference triangle sets. In this note we show how to improve these bounds by including additional valid linear inequalities in the LP formulation. We also give some new optimal di erence triangle sets found by computer search.
Related
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conference paper
Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994