The connected Grundy coloring problem : formulations and a local-search enhanced biased random-key genetic algorithm
| Year of publication: |
2025
|
|---|---|
| Authors: | Silva, Mateus C. ; Melo, Rafael A. ; Resende, Mauricio G. C. ; Santos, Marcio C. ; Toso, Rodrigo F. |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 183.2025, Art.-No. 107136, p. 1-16
|
| Subject: | BRKGA | Discrete optimization | Graph coloring | Greedy heuristic | Grundy number | Heuristik | Heuristics | Evolutionärer Algorithmus | Evolutionary algorithm | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming |
-
Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
Dib, Omar, (2017)
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
-
Exact and heuristic algorithms for the weighted total domination problem
Álvarez-Miranda, Eduardo, (2021)
- More ...
-
Obtaining the Grundy chromatic number : how bad can my greedy heuristic coloring be?
Silva, Mateus C., (2024)
-
Andrade, Carlos E., (2021)
-
Biased random-key genetic algorithms with applications in telecommunications
Resende, Mauricio G. C., (2012)
- More ...