A Tabu search heuristic for the generalized assignment problem. - Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2001)

A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem. - Juan A. Díaz 002; Elena Fernández 001 (J. Oper. Res. Soc., 2002)

A compact model and tight bounds for a combined location-routing problem. - Maria Albareda-Sambola; Juan A. Díaz 002; Elena Fernández 001 (Comput. Oper. Res., 2005)

Hybrid scatter search and path relinking for the capacitated p. - Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2006)

Scatter search for the single source capacitated facility location problem. - Iván A. Contreras; Juan A. Díaz 002 (Ann. Oper. Res., 2008)

Lagrangean relaxation for the capacitated hub location problem with single assignment. - Iván A. Contreras; Juan A. Díaz 002; Elena Fernández 001 (OR Spectr., 2009)

Lagrangean duals and exact solution to the capacitated p-center problem. - Maria Albareda-Sambola; Juan A. Díaz 002; Elena Fernández 001 (Eur. J. Oper. Res., 2010)

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. - Iván A. Contreras; Juan A. Díaz 002; Elena Fernández 001 (INFORMS J. Comput., 2011)

A hybrid algorithm for the manufacturing cell formation problem. - Juan A. Díaz 002; Dolores E. Luna; Carlos Armando Zetina (J. Heuristics, 2013)

Computing Semi-Stable Semantics of AF by 0-1 Integer Programming. - Mauricio Osorio 001; Juan Díaz 002; Alejandro Santoyo (LANMR, 2014)

Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming. - Mauricio Osorio 001; Juan Díaz 002; Alejandro Santoyo (MICAI (1), 2014)

A dual bounding scheme for a territory design problem. - Mónica G. Elizondo-Amaya; Roger Z. Ríos-Mercado; Juan A. Díaz 002 (Comput. Oper. Res., 2014)

Computing stable semantics of AF by 0-1 integer programming. - Mauricio Osorio 001; Juan Díaz 002; Alejandro Santoyo (CONIELECOMP, 2015)

Primal and dual bounds for the vertex p-median problem with balance constraints. - Juan A. Díaz 002; Dolores E. Luna (Ann. Oper. Res., 2017)

0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks. - Mauricio Osorio 001; Juan Díaz 002; Alejandro Santoyo (Computación y Sistemas, 2017)

GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. - Juan A. Díaz 002; Dolores E. Luna; José-Fernando Camacho-Vallejo; Martha-Selene Casas-Ramírez (Expert Syst. Appl., 2017)

GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence. - Juan A. Díaz 002; Dolores E. Luna (J. Oper. Res. Soc., 2018)

Math-Heuristic for a Territory Design Problem. - Mario A. Solana; Juan A. Díaz 002; Dolores E. Luna (ICCL, 2019)

An improved exact algorithm for a territory design problem with p-center-based dispersion minimization. - Maria Gabriela Sandoval; Juan A. Díaz 002; Roger Z. Ríos-Mercado (Expert Syst. Appl., 2020)

A bi-level maximal covering location problem. - Martha-Selene Casas-Ramírez; José-Fernando Camacho-Vallejo; Juan A. Díaz 002; Dolores E. Luna (Oper. Res., 2020)

Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem. - Juan-Carlos García-Vélez; Diego Ruiz-Hernández; José-Fernando Camacho-Vallejo; Juan A. Díaz 002 (Comput. Oper. Res., 2024)