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

• Type: Journal
• Year: 2011
• Where: ORL
• Authors: James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
• Keywords: Integer Programming Techniques, Operations Research, ORL 2011, Steiner Tripe System, Steiner Triple System