Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
Year of publication: |
2019
|
---|---|
Authors: | Lin, Weibo ; Xiao, Mingyu ; Zhou, Yi ; Guo, Zhenyu |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 109.2019, p. 263-272
|
Subject: | Minimum sum coloring | Optimum cost chromatic partition | Lower bounds | Graph algorithms | Graph coloring | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
Optimal shift coloring of trees
Adreatta, Giovanni, (2014)
-
Reinforcement learning based tabu search for the minimum load coloring problem
Sun, Zhe, (2022)
- More ...
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
-
Computing maximum k-defective cliques in massive graphs
Chen, Xiaoyu, (2021)
-
Ma, Mengfan, (2023)
- More ...