Publisher
Springer Science and Business Media LLC
Subject
Software,Theoretical Computer Science
Reference30 articles.
1. Balas, E., de Souza, C.C.: The vertex separator problem: a polyhedral investigation. Math. Program. 103(3), 583–608 (2005)
2. Barahona, F.: On the k-cut problem. Oper. Res. Lett. 26(3), 99–105 (2000)
3. Bastubbe, M., Lübbecke, M.: A branch-and-price algorithm for capacitated hypergraph vertex separation. Technical Report, Optimization (2017)
4. Ben-Ameur, W., Biha, M.D.: On the minimum cut separator problem. Networks 59(1), 30–36 (2012)
5. Ben-Ameur, W., Mohamed-Sidi, M.A., Neto, J.: The k-separator problem. In: Computing and Combinatorics, pp. 337–348 (2013)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献