Burning graphs through farthest-first traversal J García-Díaz, JC Pérez-Sansalvador, LMX Rodríguez-Henríquez, ... IEEE Access 10, 30395-30404, 2022 | 14 | 2022 |
Solving the capacitated vertex k-center problem through the minimum capacitated dominating set problem JA Cornejo Acosta, J García Díaz, R Menchaca-Méndez, ... Mathematics 8 (9), 1551, 2020 | 8 | 2020 |
Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems JA Cornejo-Acosta, J García-Díaz, JC Pérez-Sansalvador, C Segura Mathematics 11 (13), 3014, 2023 | 4 | 2023 |
A greedy heuristic for graph burning J García-Díaz, JA Cornejo-Acosta arXiv preprint arXiv:2401.07577, 2024 | | 2024 |
A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem JA Cornejo-Acosta, J García-Díaz, JC Pérez-Sansalvador, ... ACM Journal of Experimental Algorithmics 28, 1-26, 2023 | | 2023 |
A First Approach to Asynchronous-Synchronous Tradeoff in 1D Cellular Genetic Algorithms JA Cornejo-Acosta, J García-Díaz Research in Computing Science 150 (12), 2021 | | 2021 |
Un enfoque al problema dinámico de múltiples agentes viajeros con programación heurística JA Cornejo Acosta, HJ Puga Soberanes, JM Carpio Valadez, ... | | |