Author of the publication

An approximation method for the P-median problem: A bioinspired tabu search and variable neighborhood search partitioning approach.

, , , , , , , and . Int. J. Hybrid Intell. Syst., 13 (2): 87-98 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Planificación reactiva de movimientos en tiempo real para robots móviles., , , , and . Res. Comput. Sci., 147 (7): 115-128 (2018)Diseño de un robot móvil controlado por un agente reactivo en tiempo real., , , , , , and . Res. Comput. Sci., (2016)Uso del algoritmo de colonia de hormigas en el aprendizaje de redes bayesianas., , , , and . Res. Comput. Sci., (2016)Editorial for Volume 6 Number 3-Computing Solutions inspired in Biology., , , , and . Int. J. Comb. Optim. Probl. Informatics, 6 (3): 1-4 (2015)A Hybrid VNS/TABU Search Algorithm for Solution the P-Median Problem., , , , and . Int. J. Comb. Optim. Probl. Informatics, 11 (2): 67-74 (2020)P-Median Equivalence and Partitioning in Logistics Problems., , , , and . WEA, volume 1685 of Communications in Computer and Information Science, page 185-197. Springer, (2022)Metaheuristics with Local Search Miscellany Applied to the Quadratic Assignment Problem for Large-Scale Instances., , , and . WEA, volume 1431 of Communications in Computer and Information Science, page 327-334. Springer, (2021)Bioinspired Tabu Search for Geographic Partitioning., , , , , and . NaBIC, volume 419 of Advances in Intelligent Systems and Computing, page 189-199. Springer, (2015)Quadratic Assignation Problem: A solution approach with parallel GRASP., , , , , and . Int. J. Comb. Optim. Probl. Informatics, 8 (3): 33-38 (2017)Solution Search for the Capacitated P-Median Problem using Tabu Search., , , , and . Int. J. Comb. Optim. Probl. Informatics, 10 (2): 17-25 (2019)