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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991