Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
Mathematical programming studies1974pp. 72–81
Citations Over TimeTop 10% of 1974 papers
Related Papers
- → A Note on Varying Cardinality in the Average Case Setting(1993)9 cited
- → Differences between real and integer production possibility sets in data envelopment analysis(2015)1 cited
- → On the cardinality of some powersets(1978)1 cited
- → Identifying Maximal Non-Redundant Integer Cone Generators(2019)
- Identifying Maximal Non-Redundant Integer Cone Generators(2019)