Sciweavers

ORL
2011

Solving large Steiner Triple Covering Problems

13 years 5 months ago
Solving large Steiner Triple Covering Problems
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 techniques. One major source of difficulty for instances of this family is their highly symmetric structure, which impairs the performance of most branch-and-bound algorithms. The largest instance in the family that has been solved corresponds to a Steiner Tripe System of
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where ORL
Authors James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
Comments (0)