scientific article; zbMATH DE number 1405802

MaRDI QIDQ4938787zbMATH OpenFDO

Authors Lucia Moura

Publication date 27 March 2000

zbMATH Keywords

\(t\)-designbranch-and-cutcliqueindependent setisomorph rejectionpacking designpacking numberspolyhedral algorithm

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Rank inequalities and separation algorithms for packing designs and sparse triple systems.
• Constructing designs straightforwardly: Worst arising cases
• Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
• scientific article; zbMATH DE number 874532
• scientific article; zbMATH DE number 812055

Cited in

(8)

• More-than-nearly-perfect packings and partial designs
• Rank inequalities and separation algorithms for packing designs and sparse triple systems.
• Constructing designs straightforwardly: Worst arising cases
• q-analogs of packing designs
• scientific article; zbMATH DE number 3926962 (Why is no real title available?)
• scientific article; zbMATH DE number 1066165 (Why is no real title available?)
• scientific article; zbMATH DE number 898426 (Why is no real title available?)
• Restricted b‐factors in bipartite graphs and t‐designs

Describes a project that uses

Uses Software

• nauty

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 Q4938787)