| A compact model and tight bounds for a combined location-routing problem M Albareda-Sambola, JA Dı́az, E Fernández Computers & operations research 32 (3), 407-428, 2005 | 257 | 2005 |
| A tabu search heuristic for the generalized assignment problem JA Dıaz, E Fernández European Journal of Operational Research 132 (1), 22-38, 2001 | 194 | 2001 |
| Reactive GRASP and Tabu Search based heuristics for the single source capacitated plant location problem H Delmaire, JA Diaz, E Fernandez, M Ortega Infor-Information Systems and Operational Research 37 (3), 194-225, 1999 | 181 | 1999 |
| Hybrid scatter search and path relinking for the capacitated p-median problem JA Díaz, E Fernandez European Journal of Operational Research 169 (2), 570-585, 2006 | 133 | 2006 |
| Lagrangean relaxation for the capacitated hub location problem with single assignment I Contreras, JA Díaz, E Fernández OR spectrum 31 (3), 483-505, 2009 | 116 | 2009 |
| Branch and price for large-scale capacitated hub location problems with single assignment I Contreras, JA Díaz, E Fernández INFORMS Journal on Computing 23 (1), 41-55, 2011 | 109 | 2011 |
| A branch-and-price algorithm for the single source capacitated plant location problem JA Díaz, E Fernández Journal of the Operational Research Society 53 (7), 728-740, 2002 | 87 | 2002 |
| Scatter search for the single source capacitated facility location problem IA Contreras, JA Díaz Annals of Operations Research 157 (1), 73-89, 2008 | 70 | 2008 |
| Lagrangean duals and exact solution to the capacitated p-center problem M Albareda-Sambola, JA Díaz, E Fernández European Journal of Operational Research 201 (1), 71-81, 2010 | 49 | 2010 |
| Comparing new heuristics for the pure integer capacitated plant location problem H Delmaire, JA Diaz, E Fernandez, M Ortega Dr97/10, dpt. e10, Univ. Politecnica de Catalunya, Spain, 1997 | 42 | 1997 |
| A GRASP heuristic for the manufacturing cell formation problem JA Díaz, D Luna, R Luna Top 20 (3), 679-706, 2012 | 37 | 2012 |
| GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering JA Díaz, DE Luna, JF Camacho-Vallejo, MS Casas-Ramírez Expert Systems with Applications 82, 67-76, 2017 | 27 | 2017 |
| A dual bounding scheme for a territory design problem MG Elizondo-Amaya, RZ Ríos-Mercado, JA Díaz Computers & operations research 44, 193-205, 2014 | 24 | 2014 |
| A bi-level maximal covering location problem MS Casas-Ramírez, JF Camacho-Vallejo, JA Díaz, DE Luna Operational Research 20 (2), 827-855, 2020 | 6 | 2020 |
| An improved exact algorithm for a territory design problem with p-center-based dispersion minimization MG Sandoval, JA Díaz, RZ Ríos-Mercado Expert Systems with Applications 146, 113150, 2020 | 6 | 2020 |
| A hybrid algorithm for the manufacturing cell formation problem JA Díaz, DE Luna, CA Zetina Journal of Heuristics 19 (1), 77-96, 2013 | 6 | 2013 |
| relajación lagrangeana para el problema de particionamiento de áreas geográficas JAD García, MBB Loranca, DEL Reyes, EO Benítez, JLM Flores Revista de Matemática: Teoría y Aplicaciones 19 (2), 169-181, 2012 | 4* | 2012 |
| Heuristic approaches for solving a class of combined location-routing problem M Albareda-Sambola, JA Díaz, E Fernández 4th Metaheuristics international conference, 405-410, 2001 | 4 | 2001 |
| Bounding procedures and exact solutions for a class of territory design problems JA Díaz, DE Luna, MG Sandoval Optimal Districting and Territory Design, 77-103, 2020 | 3 | 2020 |
| Primal and dual bounds for the vertex p-median problem with balance constraints JA Díaz, DE Luna Annals of Operations Research 258 (2), 613-638, 2017 | 3 | 2017 |
Osorio MauricioUniversidad de las Américas PueblaDirección de correo verificada de udlap.mx
