Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples (1973)

by D R Fulkerson, G L Nemhauser, L E Trotter
Venue:Mathematical Programming Study