Add to ORKGA Branch-and-Cut algorithm for nding covering designs is presented. Its original-ity resides in the use of isomorphism pruning of the enumeration tree. A proof that no 4 (10; 5; 1)-covering design with less than 51 sets exists is obtained together with all non isomorphic 4 (10; 5; 1)-covering designs with 51 sets
AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=...
In the test cover problem a set of items is given together with a collection of subsets of the items...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
Many combinatorial problems can be formulated as a 0-1 integer linear program (0-1 ILP), which consi...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
AbstractStandardised tight single-change covering designs with v = 12, k = 4 are enumerated and clas...
A double-change covering design (dccd) is an ordered set of blocks with block size k is an ordered c...
A (2, k, v) covering design is a pair (X, F) such that X is a v-element set and F is a family of k-e...
AbstractA packing (respectively covering) design of order v, block size k, and index λ is a collecti...
Abstract. This paper describes components of a branch-and-cut algorithm for solving in-teger linear ...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determ...
For two polyhedra associated withpacking subtrees of a tree, the structure of the vertices is descri...
Inspired by the “generalized t-designs ” defined by Cameron [P. J. Cameron, A generalisation of t-de...
Tessellation designs composed from tiles in periodic space fillings are considered. An efficient alg...
AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=...
In the test cover problem a set of items is given together with a collection of subsets of the items...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...
Many combinatorial problems can be formulated as a 0-1 integer linear program (0-1 ILP), which consi...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
AbstractStandardised tight single-change covering designs with v = 12, k = 4 are enumerated and clas...
A double-change covering design (dccd) is an ordered set of blocks with block size k is an ordered c...
A (2, k, v) covering design is a pair (X, F) such that X is a v-element set and F is a family of k-e...
AbstractA packing (respectively covering) design of order v, block size k, and index λ is a collecti...
Abstract. This paper describes components of a branch-and-cut algorithm for solving in-teger linear ...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determ...
For two polyhedra associated withpacking subtrees of a tree, the structure of the vertices is descri...
Inspired by the “generalized t-designs ” defined by Cameron [P. J. Cameron, A generalisation of t-de...
Tessellation designs composed from tiles in periodic space fillings are considered. An efficient alg...
AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=...
In the test cover problem a set of items is given together with a collection of subsets of the items...
In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refi...