Publication:4938787
From MaRDI portal
zbMath0935.05031MaRDI QIDQ4938787
Publication date: 27 March 2000
\(t\)-design; independent set; packing design; clique; branch-and-cut; packing numbers; polyhedral algorithm; isomorph rejection
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05B05: Combinatorial aspects of block designs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05B40: Combinatorial aspects of packing and covering
Related Items
Restricted b‐factors in bipartite graphs and t‐designs, Rank inequalities and separation algorithms for packing designs and sparse triple systems.
Uses Software
