.png){kind=icon}
返回
New algorithms for the minimum coloring cut problem
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12494.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The minimum coloring cut problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E' is minimum. In this work, we present two approaches based on variable neighborhood search to solve this problem. Our algorithms are able to find all the optimum solutions described in the literature.
Keyword:
minimum coloring cut problem
combinatorial optimization
graph theory
variable neighborhood search
label cut problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications
PREAI
分享收藏 没有更多内容
没有更多内容