4 search results - page 1 / 1 » The Fine Intersection Problem for Steiner Triple Systems |
GC
2008
Springer
13 years 4 months ago
2008
Springer
COMBINATORICS
2004
13 years 4 months ago
2004
ORL
2011
12 years 11 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
IPCO
2008
13 years 6 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...