Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1111/itor.12494 | INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH |
Keywords | Field | DocType |
minimum coloring cut problem, combinatorial optimization, graph theory, variable neighborhood search, label cut problem | Graph theory,Complete coloring,Mathematical optimization,Combinatorics,Variable neighborhood search,Fractional coloring,Minimum cut,Combinatorial optimization,Greedy coloring,Mathematics,Maximum cut | Journal |
Volume | Issue | ISSN |
26 | 5 | 0969-6016 |
Citations | PageRank | References |
4 | 0.44 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Augusto Bordini | 1 | 4 | 0.44 |
| Fábio Protti | 2 | 357 | 46.14 |