Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference28 articles.
1. Baum, S., Trotter, L.E.J.: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebraic Discrete Methods 2, 416–425 (1981)
2. Benchetrit, Y., Sebő, A.: Ear-Decompositions and the Complexity of the Matching Polytope. arXiv preprint arXiv:1509.05586 (2015)
3. Bruhn, H., Schaudt, O.: Claw-free t-perfect graphs can be recognised in polynomial time. In: Lee, J., Vygen, J. (eds.) Integer programming and combinatorial optimization, pp. 404–415. Springer, Berlin (2014)
4. Bruhn, H., Stein, M.: On claw-free t-perfect graphs. Math. Program. 133(1–2), 461–480 (2012)
5. Cao, D., Nemhauser, G.L.: Polyhedral characterizations and perfection of line graphs. Discrete Appl. Math. 81, 141–154 (1998)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献