Mar 17, 2003 · In this article, we study polytopes associated with t-(v,k,λ) packing designs and with m-sparse PSTSs. Subpacking and l-sparseness inequalities ...

The 5-sparse Steiner triple systems are the systems that are both anti-Pasch and anti-mitre. Although there are some results on 5-sparse STSs [7,16], the ...

In this article, we study polytopes associated with t-(v,k,λ) packing designs and with m-sparse PSTSs. Subpacking and l-sparseness inequalities are introduced ...

Rank inequalities and separation algorithms for packing designs and sparse triple systems · Lucia Moura · Published in Theoretical Computer Science 17 March 2003 ...

Given a point outside a polytope and a class of valid inequalities for the polytope, a separation algorithm determines an inequality that is violated by the ...

Moura L(2003)Rank inequalities and separation algorithms for packing designs and sparse triple systemsTheoretical Computer ...

Oct 7, 2024 · Rank inequalities and separation algorithms for packing designs and sparse triple systems. Theor. Comput. Sci. 297(1-3): 367-384 (2003); 2000.

LUCIA MOURA, Rank inequalities and separation algorithms for packing designs and sparse triple systems, Theoretical Computer Science 297 (2003), 367-384.

Rank inequalities and separation algorithms for packing designs and sparse triple systems. Request PDF. Restricted access. Theoretical Computer Science. Profile ...

Rank inequalities and separation algorithms for packing designs and sparse triple systems · Lucia Moura. Computer Science, Mathematics. Theor. Comput. Sci. 2003.