.png){kind=icon}
返回
Multistart search for the Cyclic Cutwidth Minimization Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2020.105116.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Cyclic Cutwidth Minimization Problem (CCMP) is a Graph Layout Problem that consists of finding an embedding of the vertices of a candidate graph in a host graph, in order to minimize the maximum cut of a host edge. In this case, the host graph is restricted to be a cycle. In this paper, we identify a new lower bound for the problem, and also a property which allows search procedures to drastically reduce the neighborhood size during the search. Additionally, we propose the use of an alternative objective function for min-max optimization problems, never used before in the context of the CCMP. These strategies have been combined within a multistart search procedure for this problem. The obtained method is compared with the state of the art for the CCMP using sets of problem instances previously published. Statistical tests indicate the merit of our proposal. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Cyclic cutwidth
Graph layout problem
Circular embedding
Tabu Search
Multistart search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Perspectives from individuals with low education and interviewers using the GloboDiet 24 h recall: a qualitative study来自低教育水平个体和GloboDiet 24小时回顾法访谈者的视角：一项定性研究
OAAI
OAAI分享收藏Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏
查看更多内容