Improved solutions to the Steiner triple covering problem

Information Processing Letters

Volumn 65, Issue 2, 1998, Pages 67-69

  Odijk, Michiel A ^a   Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Combinatorial problems; Set covering problems; Steiner triple systems; Width of matrices

Indexed keywords

EID: 0003609713     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)80440-1     Document Type: Article

References (15)

1. D. Avis, A note on some computationally difficult set covering problems, Math. Programming 18 (1980) 138-145.
2. V. Chvátal, A greedy heuristic for the set covering problem, Math. Oper. Res. 4 (1979) 233-235.
3. F.N. Cole, A.S. White, L.D. Cumming, Complete classification of triad systems on fifteen elements, Mem. Nat. Acad. Sci. 14, Second Memoir 89 (1925).
4. T.A. Feo, M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper. Res. Lett. 8 (1989) 67-71.
5. T.A. Feo, M.G.C. Resende, Greedy randomized adaptive search procedures, J. Global Optimization 6 (1995) 109-133.
6. D.R. Fulkerson, H.J. Ryser, Widths and heights of (0, 1)-matrices, Canad. J. Math. 13 (1961) 239-255.
7. D.R. Fulkerson, H.J. Ryser, Multiplicities and minimal widths for (0, 1)-matrices, Canad. J. Math. 14 (1962) 498-508.
8. D.R. Fulkerson, H.J. Ryser, Width sequences for special classes of (0, 1)-matrices, Canad. J. Math. 15 (1963) 371-396.
9. D.R. Fulkerson, G.L. Nemhauser, L.E. Trotter, Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Programming Study 2 (1974) 72-81.
10. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
11. M. Hall Jr, Combinatorial Theory, Blaisdell, Waltham, 1967.
12. N. Karmarkar, M.G.C. Resende, K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Math. Programming 52 (1991) 597-618.
13. C. Mannino, A. Sassano, Solving hard set covering problems, Oper. Res. Lett. 18 (1995) 1-5.
14. M.G.C. Resende, http://elib.zib.de/netlib/att/math/resende/data
15. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proc. 10th Nat. Conf. on Artificial Intelligence (AAAI-92), San Jose, 1992, pp. 440-446.