A biased random-key genetic algorithm for the chordal completion problem
RAIRO-Oper. Res., 57 3 (2023) 1559-1578
Published online: 2023-06-26
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Biased random-key genetic algorithms: A review
Mariana A. Londe, Luciana S. Pessoa, Carlos E. Andrade and Mauricio G.C. ResendeEuropean Journal of Operational Research 321 (1) 1 (2025)
https://doi.org/10.1016/j.ejor.2024.03.030
Term-sparse polynomial optimization for the design of frame structures
Marouan Handa, Marek Tyburec and Michal KočvaraOptimization and Engineering 26 (4) 2867 (2025)
https://doi.org/10.1007/s11081-025-10000-5
1 (2025)
https://doi.org/10.1007/978-3-319-07153-4_30-2
921 (2025)
https://doi.org/10.1007/978-3-032-00385-0_30
The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm
Mateus C. Silva, Rafael A. Melo, Mauricio G.C. Resende, Marcio C. Santos and Rodrigo F. TosoComputers & Operations Research 183 107136 (2025)
https://doi.org/10.1016/j.cor.2025.107136
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?
Mateus C. Silva, Rafael A. Melo, Mauricio G.C. Resende, Marcio C. Santos and Rodrigo F. TosoComputers & Operations Research 168 106703 (2024)
https://doi.org/10.1016/j.cor.2024.106703