Breakout local search for the cyclic cutwidth minimization problem-Reference-Cited by-同舟云学术

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

Breakout local search for the cyclic cutwidth minimization problem

Published:2022-08-31 Issue:5-6 Volume:28 Page:583-618
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

He Mu,Wu Qinghua,Lu Yongliang

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

https://link.springer.com/content/pdf/10.1007/s10732-022-09504-5.pdf

Reference28 articles.

1. Allmond, H.: On the cyclic cutwidth of complete tripartite and n-partite graphs. CSUSB REU (2006)

2. Bansal, R., Srivastava, K., Srivastava, S.: A hybrid evolutionary algorithm for the cutwidth minimization problem. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1–8. IEEE (2012)

3. Benlic, U., Hao, J.-K.: A study of breakout local search for the minimum sum coloring problem. In: Asia-Pacific Conference on Simulated Evolution and Learning, pp. 128–137. Springer (2012)

4. Benlic, U., Hao, J.-K.: Breakout local search for the vertex separator problem. In: Twenty-Third International Joint Conference on Artificial Intelligence (2013)

5. Benlic, U., Hao, J.-K.: Breakout local search for maximum clique problems. Comput. Oper. Res. 40(1), 192–206 (2013)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP