default search action
Juan Díaz 0002
Person information
- affiliation: Universidad de las Américas Puebla, Department of Actuary, Physics and Mathematics, Cholula, Mexico
Other persons with the same name
- Juan Díaz — disambiguation page
- Juan Díaz 0001
— University of Oviedo, Department of Electric, Electronic, Communication and Systems Engineering, DIEECS, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Juan-Carlos García-Vélez, Diego Ruiz-Hernández
Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem. Comput. Oper. Res. 161: 106418 (2024) - 2020
- [j16]Maria Gabriela Sandoval
An improved exact algorithm for a territory design problem with p-center-based dispersion minimization. Expert Syst. Appl. 146: 113150 (2020) - [j15]Martha-Selene Casas-Ramírez
A bi-level maximal covering location problem. Oper. Res. 20(2): 827-855 (2020)
2010 – 2019
- 2019
- [c4]Mario A. Solana, Juan A. Díaz
Math-Heuristic for a Territory Design Problem. ICCL 2019: 67-82 - 2018
- [j14]Juan A. Díaz
GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence. J. Oper. Res. Soc. 69(9): 1493-1511 (2018) - 2017
- [j13]Juan A. Díaz
Primal and dual bounds for the vertex p-median problem with balance constraints. Ann. Oper. Res. 258(2): 613-638 (2017) - [j12]Mauricio Osorio, Juan Díaz, Alejandro Santoyo:
0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks. Computación y Sistemas 21(3) (2017) - [j11]Juan A. Díaz
GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Syst. Appl. 82: 67-76 (2017) - 2015
- [c3]Mauricio Osorio, Juan Díaz
Computing stable semantics of AF by 0-1 integer programming. CONIELECOMP 2015: 204-211 - 2014
- [j10]Mónica G. Elizondo-Amaya, Roger Z. Ríos-Mercado
A dual bounding scheme for a territory design problem. Comput. Oper. Res. 44: 193-205 (2014) - [c2]Mauricio Osorio, Juan Díaz, Alejandro Santoyo:
Computing Semi-Stable Semantics of AF by 0-1 Integer Programming. LANMR 2014: 1-10 - [c1]Mauricio Osorio, Juan Díaz
Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming. MICAI (1) 2014: 419-430 - 2013
- [j9]Juan A. Díaz
A hybrid algorithm for the manufacturing cell formation problem. J. Heuristics 19(1): 77-96 (2013) - 2011
- [j8]Iván A. Contreras
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment. INFORMS J. Comput. 23(1): 41-55 (2011) - 2010
- [j7]Maria Albareda-Sambola
Lagrangean duals and exact solution to the capacitated p-center problem. Eur. J. Oper. Res. 201(1): 71-81 (2010)
2000 – 2009
- 2009
- [j6]Iván A. Contreras
Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr. 31(3): 483-505 (2009) - 2008
- [j5]Iván A. Contreras
Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157(1): 73-89 (2008) - 2006
- [j4]Juan A. Díaz
Hybrid scatter search and path relinking for the capacitated p. Eur. J. Oper. Res. 169(2): 570-585 (2006) - 2005
- [j3]Maria Albareda-Sambola
A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32: 407-428 (2005) - 2002
- [j2]Juan A. Díaz
A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem. J. Oper. Res. Soc. 53(7): 728-740 (2002) - 2001
- [j1]Juan A. Díaz
A Tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. 132(1): 22-38 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: