A discrete dynamic convexized method for the max-cut problem
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Link
http://link.springer.com/content/pdf/10.1007/s10479-012-1133-2.pdf
Reference23 articles.
1. Barahona, F., Grötschel, M., & Reinelt, G. (1988). An application of combinatorial optimization to statistical physical and circuit layout design. Operational Research, 36, 493–513.
2. Benson, S., Ye, Y., & Zhang, X. (1999). Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optimization Methods & Software, 11, 515–544.
3. Burer, S., & Monteiro, R. D. C. (2001). A projected gradient algorithm for solving the maxcut SDP problem. Optimization Methods & Software, 15, 175–200.
4. Burer, S., Monteiro, R. D. C., & Zhang, Y. (2001). Rank-two relation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization, 12, 503–521.
5. Chang, K. C., & Du, D.-Z. (1987). Efficient algorithms for layer assignment problems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6, 67–78.
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph partitioning: an updated survey;AKCE International Journal of Graphs and Combinatorics;2022-11-22
2. An effective iterated tabu search for the maximum bisection problem;Computers & Operations Research;2017-05
3. Discrete Cuckoo Search with Local Search for Max-cut Problem;IFIP Advances in Information and Communication Technology;2017
4. A multiple search operator heuristic for the max-k-cut problem;Annals of Operations Research;2016-06-01
5. An Integrated Method Based on PSO and EDA for the Max-Cut Problem;Computational Intelligence and Neuroscience;2016
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3