Author:
Östergård Patric R. J.,Vaskelainen Vesa P.
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Avis D.: A note on some computationally difficult set covering problems. Math. Programm. 18, 138–145 (1980)
2. Colbourn C.J., Rosa A.: Triple Systems. Oxford University Press, Oxford (1999)
3. Fulkerson D.R., Nemhauser G.L., Trotter L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Programm. Stud. 2, 72–81 (1974)
4. Hall M. Jr: Combinatorial Theory. Blaisdell, Waltham (1967)
5. Heras F., Larrosa J., Oliveras A.: MiniMaxSat an efficient weighted Max-SAT solver. J. Artif. Intell. Res. 31, 1–32 (2008)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献