.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
minimum coloring cut problem
combinatorial optimization
graph theory
variable neighborhood search
label cut problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K
