Author:
Delling Daniel,Fleischman Daniel,Goldberg Andrew V.,Razenshteyn Ilya,Werneck Renato F.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference66 articles.
1. Armbruster, M.: Branch-and-cut for a semidefinite relaxation of large-scale minimum bisection problems. Ph.D. thesis, Technische Universität Chemnitz (2007)
2. Armbruster, M.: Graph bisection and equipartition (2007). http://www.tu-chemnitz.de/mathematik/discrete/armbruster/diss/
3. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO), LNCS, vol. 5035, pp. 112–124 (2008)
4. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Progr. Comput. 4(3), 275–306 (2012)
5. Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: Graph Partitioning and Graph Clustering–10th DIMACS Implementation Challenge Workshop, Contemporary Mathematics, vol. 588. American Mathematical Society and Center for Discrete Mathematics and Theoretical Computer Science (2013). http://www.cc.gatech.edu/dimacs10/
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献