Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms

Published:2024-11 Issue: Volume:165 Page:112109
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Mehrizi Ahmad Abouyee,Ghanbari Reza,Sadeghi Sedigheh^ORCID,Ghorbani-Moghadam Khatere

Publisher

Elsevier BV

Reference49 articles.

1. Graph Partitioning;Bichot,2013

2. Graph partitioning models for parallel computing;Hendrickson;Parallel Comput.,2000

3. Partitioning sparse matrices with eigenvectors of graphs;Pothen;SIAM J. Matrix Anal. Appl.,1997

4. VLSI Physical Design: From Graph Partitioning To Timing Closure;Kahng,2010

5. Normalized cuts and image segmentation;Shi;IEEE Trans. Pattern Anal. Mach. Intell.,2000

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP