A fast local search algorithm for minimum sum coloring problem on massive graphs
Year of publication: |
2024
|
---|---|
Authors: | Li, Yan ; Zhao, Mengyu ; Zhang, Xindi ; Wang, Yiyuan |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 172.2024, Art.-No. 106794, p. 1-13
|
Subject: | Optimization | Minimum sum coloring problem | Local search | Massive graph | Graphentheorie | Graph theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
A fast vertex weighting-based local search for finding minimum connected dominating sets
Wu, Xinyun, (2022)
-
Towards more efficient local search for weighted graph coloring problem in massive graphs
Pan, Shiwei, (2025)
-
Multistart search for the cyclic cutwidth minimization problem
Cavero, Sergio, (2021)
- More ...
-
Wang, Yiyuan, (2017)
-
NuMWVC : a novel local search for minimum weighted vertex cover problem
Li, Ruizhi, (2020)
-
An improved configuration checking-based algorithm for the unicost set covering problem
Wang, Yiyuan, (2021)
- More ...