scientific article; zbMATH DE number 898426

MaRDI QIDQ4884219zbMATH OpenFDO

Authors Lucia Moura

Publication date 8 July 1996

zbMATH Keywords

combinatorial designspolyhedral theory

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1405802
• scientific article; zbMATH DE number 1512680
• Rank inequalities and separation algorithms for packing designs and sparse triple systems.
• scientific article; zbMATH DE number 863483

Cited in

(7)

• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
• Rank inequalities and separation algorithms for packing designs and sparse triple systems.
• Problems and algorithms for covering arrays via set covers
• The many aspects of counting lattice points in polytopes
• Polymake: an approach to modular software design in computational geometry
• Restricted b‐factors in bipartite graphs and t‐designs
• Uniform design over a convex polyhedron.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884219)