Name
Abstract | ||
|---|---|---|
This paper studies a robust graph coloring problem, which is a variant of the classical graph coloring problem, where penalties are charged for non-adjacent vertices that are assigned the same color. The problem can be formulated as an unconstrained quadratic programming problem, and has many applications in industry. Since the problem is known to be strongly NP-complete, we develop a number of metaheuristics for it, which are based on various encoding schemes, neighborhood structures, and search algorithms. Extensive experiments suggest that our metaheuristics with a partition based encoding scheme and an improvement graph based neighborhood outperform other methods tested in our study. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10732-011-9180-4 | J. Heuristics |
Keywords | Field | DocType |
Metaheuristics,Robust graph coloring,Unconstrained quadratic programming | Mathematical optimization,Search algorithm,Distance-hereditary graph,Graph bandwidth,Artificial intelligence,Greedy coloring,Factor-critical graph,Graph partition,Machine learning,Mathematics,Graph coloring,Metaheuristic | Journal |
Volume | Issue | ISSN |
19 | 4 | 1381-1231 |
Citations | PageRank | References |
3 | 0.44 | 21 |
Authors | ||
2 | ||