Seguir
Juan Díaz
Título
Citado por
Citado por
Año
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
2852005
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
2192001
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
1951999
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
1462006
Lagrangean relaxation for the capacitated hub location problem with single assignment
I Contreras, JA Díaz, E Fernández
OR spectrum 31, 483-505, 2009
1372009
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
1252011
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
962002
Scatter search for the single source capacitated facility location problem
IA Contreras, JA Díaz
Annals of Operations Research 157, 73-89, 2008
842008
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
602010
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
502017
A GRASP heuristic for the manufacturing cell formation problem
JA Díaz, D Luna, R Luna
Top 20, 679-706, 2012
422012
Comparing new heuristics for the pure integer capacitated plant location problem
H Delmaire, JA Diaz, E Fernandez, M Ortega
Investigacion Operativa 8 (1), 2, 1997
411997
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
302014
A novel districting design approach for on-time last-mile delivery: An application on an express postal company
MG Sandoval, E Álvarez-Miranda, J Pereira, RZ Ríos-Mercado, JA Díaz
Omega 113, 102687, 2022
252022
A bi-level maximal covering location problem
MS Casas-Ramírez, JF Camacho-Vallejo, JA Díaz, DE Luna
Operational Research 20, 827-855, 2020
242020
Integrated cross-dock door assignment and truck scheduling with handling times
SI Sayed, I Contreras, JA Diaz, DE Luna
Top 28, 705-727, 2020
222020
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
172020
A hybrid algorithm for the manufacturing cell formation problem
JA Díaz, DE Luna, CA Zetina
Journal of Heuristics 19, 77-96, 2013
62013
Relajación lagrangeana para el problema de particionamiento de áreas geográficas
JA Díaz García, MB Bernábe Loranca, DE Luna Reyes, ...
Revista de Matemática Teoría y Aplicaciones 19 (2), 169-181, 2012
6*2012
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
52020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20