New algorithms for the minimum coloring cut problem

被引：6

作者：

Bordini, Augusto ^{[1
,2
]}

Protti, Fabio ^{[1
]}

da Silva, Thiago Gouveia ^{[1
,3
]}

de Sousa Filho, Gilberto Farias ^{[4
]}

机构：

[1] Univ Fed Fluminense, Niteroi, RJ, Brazil

[2] Petrobras SA, Rio De Janeiro, RJ, Brazil

[3] Inst Fed Educ Ciencia & Tecnol Paraiba, Joao Pessoa, Paraiba, Brazil

[4] Univ Fed Paraiba, Joao Pessoa, Paraiba, Brazil

来源：

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2019年 / 26卷 / 05期

关键词：

minimum coloring cut problem; combinatorial optimization; graph theory; variable neighborhood search; label cut problem;

D O I：

10.1111/itor.12494

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：1868 / 1883

页数：16

共 50 条

[1] Algorithms for the minimum sum coloring problem: a review
Jin, Yan
Hamiez, Jean-Philippe
Hao, Jin-Kao
[J]. ARTIFICIAL INTELLIGENCE REVIEW, 2017, 47 (03) : 367 - 394
[2] Algorithms for the minimum sum coloring problem: a review
Yan Jin
Jean-Philippe Hamiez
Jin-Kao Hao
[J]. Artificial Intelligence Review, 2017, 47 : 367 - 394
[3] A method for the minimum coloring problem using genetic algorithms
Harmanani, Haidar
Abas, Hani
[J]. PROCEEDINGS OF THE 17TH IASTED INTERNATIONAL CONFERENCE ON MODELLING AND SIMULATION, 2006, : 487 - +
[4] Congested Clique Algorithms for the Minimum Cut Problem
Ghaffari, Mohsen
Nowicki, Krzysztof
[J]. PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 357 - 366
[5] A new approach to the minimum cut problem
Karger, DR
Stein, C
[J]. JOURNAL OF THE ACM, 1996, 43 (04) : 601 - 640
[6] A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
Delle Donne, Diego
Marenco, Javier
[J]. DISCRETE OPTIMIZATION, 2011, 8 (04) : 540 - 554
[7] New Lower Bound for the Minimum Sum Coloring Problem
Lecat, Clement
Lucet, Corinne
Li, Chu-Min
[J]. THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 853 - 859
[8] The probabilistic minimum coloring problem
Murat, C
Paschos, VT
[J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 346 - 357
[9] On the minimum load coloring problem
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Přívětivý, Aleš
Srivastav, Anand
[J]. Journal of Discrete Algorithms, 2007, 5 (03) : 533 - 545
[10] A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
Dai, Y
Imai, H
Iwano, K
Katoh, N
Ohtsuka, K
Yoshimura, N
[J]. DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 167 - 190

← 1 2 3 4 5 →