Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-38189-8_15
Reference50 articles.
1. Anjos, M.F., Wolkowicz, H.: Geometry of semidefinite max-cut relaxations via matrix ranks. J. Comb. Optim. 6(3), 237–270 (2002)
2. Anjos, M.F., Wolkowicz, H.: Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Appl. Math. 119(1–2), 79–106 (2002)
3. Anjos, M.F., Liers, F., Pardella, G., Schmutzer, A.: Engineering branch-and-cut algorithms for the equicut problem. Cahier du GERAD G-2012-15, GERAD, Montreal, QC, Canada (2012). In: Fields Institute Communications on Discrete Geometry and Optimization. Springer, Berlin (2013, to appear)
4. Armbruster, M., Fügenschuh, M., Helmberg, C., Martin, A.L.: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4(3), 275–306 (2012)
5. Barahona, F., Mahjoub, A.: On the cut polytope. Math. Program. 36, 157–173 (1986)
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A branch-and-bound algorithm for solving max-k-cut problem;Journal of Global Optimization;2021-02-11
2. Mixed-integer programming techniques for the connected max-k-cut problem;Mathematical Programming Computation;2020-04-30
3. A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems;Computational Optimization and Applications;2019-11-14
4. Exploiting sparsity for the min k-partition problem;Mathematical Programming Computation;2019-07-02
5. Improving the linear relaxation of maximum k-cut with semidefinite-based constraints;EURO Journal on Computational Optimization;2019-06
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3