Juan Díaz

According to our database, Juan Díaz authored at least 21 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

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

Comput. Oper. Res., January, 2024

2020

A bi-level maximal covering location problem.

Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo, Juan A. Díaz, Dolores E. Luna

Oper. Res., 2020

An improved exact algorithm for a territory design problem with <i>p</i>-center-based dispersion minimization.

Maria Gabriela Sandoval, Juan A. Díaz, Roger Z. Ríos-Mercado

Expert Syst. Appl., 2020

2019

Math-Heuristic for a Territory Design Problem.

Mario A. Solana, Juan A. Díaz, Dolores E. Luna

Proceedings of the Computational Logistics - 10th International Conference, 2019

2018

GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence.

Juan A. Díaz, Dolores E. Luna

J. Oper. Res. Soc., 2018

2017

GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering.

Juan A. Díaz, Dolores E. Luna, José-Fernando Camacho-Vallejo, Martha-Selene Casas-Ramírez

Expert Syst. Appl., 2017

0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks.

Mauricio Osorio, Juan Díaz, Alejandro Santoyo

Computación y Sistemas, 2017

Primal and dual bounds for the vertex p-median problem with balance constraints.

Juan A. Díaz, Dolores E. Luna

Ann. Oper. Res., 2017

2015

Computing stable semantics of AF by 0-1 integer programming.

Mauricio Osorio, Juan Díaz, Alejandro Santoyo

Proceedings of the 25. International Conference on Electronics, 2015

2014

A dual bounding scheme for a territory design problem.

Mónica G. Elizondo-Amaya, Roger Z. Ríos-Mercado, Juan A. Díaz

Comput. Oper. Res., 2014

Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming.

Mauricio Osorio, Juan Díaz, Alejandro Santoyo

Proceedings of the Human-Inspired Computing and Its Applications, 2014

Computing Semi-Stable Semantics of AF by 0-1 Integer Programming.

Mauricio Osorio, Juan Díaz, Alejandro Santoyo

Proceedings of the Ninth Latin American Workshop on Logic/Languages, 2014

2013

A hybrid algorithm for the manufacturing cell formation problem.

Juan A. Díaz, Dolores E. Luna, Carlos Armando Zetina

J. Heuristics, 2013

2011

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment.

Iván A. Contreras, Juan A. Díaz, Elena Fernández

INFORMS J. Comput., 2011

2010

Lagrangean duals and exact solution to the capacitated p-center problem.

Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández

Eur. J. Oper. Res., 2010

2009

Lagrangean relaxation for the capacitated hub location problem with single assignment.

Iván A. Contreras, Juan A. Díaz, Elena Fernández

OR Spectr., 2009

2008

Scatter search for the single source capacitated facility location problem.

Iván A. Contreras, Juan A. Díaz

Ann. Oper. Res., 2008

2006

Hybrid scatter search and path relinking for the capacitated p.

Juan A. Díaz, Elena Fernández

Eur. J. Oper. Res., 2006

2005

A compact model and tight bounds for a combined location-routing problem.

Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández

Comput. Oper. Res., 2005

2002

A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem.

Juan A. Díaz, Elena Fernández

J. Oper. Res. Soc., 2002

2001

A Tabu search heuristic for the generalized assignment problem.

Juan A. Díaz, Elena Fernández

Eur. J. Oper. Res., 2001