Geodesic
Improved LP lower bounds for difference triangle sets
The electronic journal of combinatorics, Tome 6 (1999)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 difference triangle sets found by computer search.
DOI : 10.37236/1463
Classification : 05B10, 90C05
Mots-clés : difference triangle sets, linear programming lower bound 
@article{10_37236_1463,
     author = {James B. Shearer},
     title = {Improved {LP} lower bounds for difference triangle sets},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1463},
     zbl = {0928.05009},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1463/}
}
TY  - JOUR
AU  - James B. Shearer
TI  - Improved LP lower bounds for difference triangle sets
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1463/
DO  - 10.37236/1463
ID  - 10_37236_1463
ER  - 
%0 Journal Article
%A James B. Shearer
%T Improved LP lower bounds for difference triangle sets
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1463/
%R 10.37236/1463
%F 10_37236_1463
James B. Shearer. Improved LP lower bounds for difference triangle sets. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1463

Cité par Sources :