A note on some computationally difficult set covering problems
- 1 December 1980
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 18 (1) , 138-145
- https://doi.org/10.1007/bf01588309
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Hard Knapsack ProblemsOperations Research, 1980
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974
- On the lengths of proofs in the propositional calculus (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1974
- Set Covering by Single-Branch Enumeration with Linear-Programming SubproblemsOperations Research, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969