Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
- 1 January 1974
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Trivial integer programs unsolvable by branch-and-boundMathematical Programming, 1974
- Computational experience with a group theoretic integer programming algorithmMathematical Programming, 1973
- An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration ApproachOperations Research, 1973
- Set Covering and Involutory BasesManagement Science, 1971
- An Adaptive Group Theoretic Algorithm for Integer Programming ProblemsManagement Science, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMSProceedings of the National Academy of Sciences, 1965
- Width Sequences for Special Classes of (0, 1)-MatricesCanadian Journal of Mathematics, 1963
- Multiplicities and Minimal Widths for (0, 1)-MatricesCanadian Journal of Mathematics, 1962
- Widths and Heights of (0,1) -MatricesCanadian Journal of Mathematics, 1961