论文信息 - Improved Solutions to the Steiner Triple Covering Problem - 字舞流文

Improved Solutions to the Steiner Triple Covering Problem

In this note we present improved covers for a set covering problem that arises from computing the 1-width of the incidence matrix of Steiner triples.

Hans van Maaren | Michiel A. Odijk

[1] D. R. Fulkerson,et al. Width sequences for special classes of (0,1)-matrices.: , 1963 .

[2] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[3] Mauricio G. C. Resende,et al. An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Davis Avis. A note on some computationally difficult set covering problems , 1980, Math. Program..

[6] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[8] D. R. Fulkerson,et al. Widths and heights of (0,1)-matrices. , 1961 .

[9] D. R. Fulkerson,et al. Multiplicities and minimal widths for (0,1)-matrices. , 1962 .

[10] D. R. Fulkerson,et al. Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[11] Carlo Mannino,et al. Solving hard set covering problems , 1995, Oper. Res. Lett..