| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142744 | Operations Research Letters | 2011 | 5 Pages |
Abstract
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to highly symmetric and computationally challenging set covering problems. The largest instance solved so far corresponds to a Steiner Tripe System of order 81. We present optimal solutions for systems of orders 135 and 243. These are computed by a tailored implementation of constraint orbital branching, a method designed to exploit symmetry in integer programs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio,