default search action
Jose-Juan López-Espín
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j13]Martín González
, Jose-Juan López-Espín
A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis. PeerJ Comput. Sci. 8: e828 (2022) - 2021
- [j12]Miriam Esteve
Heuristic and Backtracking Algorithms for Improving the Performance of Efficiency Analysis Trees. IEEE Access 9: 17421-17428 (2021) - [j11]Rocío Hernández-Sanjaime
Estimating Simultaneous Equation Models through an Entropy-Based Incremental Variational Bayes Learning Algorithm. Entropy 23(4): 384 (2021) - 2020
- [j10]Rocío Hernández-Sanjaime
Multilevel simultaneous equation model: A novel specification and estimation approach. J. Comput. Appl. Math. 366 (2020) - [j9]Antonio V. Contreras, Antonio Llanes
Enhancing the context-aware FOREX market simulation using a parallel elastic network model. J. Supercomput. 76(3): 2022-2038 (2020) - [c14]Inmaculada Meca
Early Warning Methodology for dropping out of university degrees. TEEM 2020: 245-249
2010 – 2019
- 2019
- [c13]Óscar Gómez, José-Juan López-Espín
Parallel algorithm for prediction of variables in Simultaneous Equation Models. HPCS 2019: 1032-1035 - 2018
- [j8]Antonio V. Contreras, Antonio Llanes
ENMX: An elastic network model to predict the FOREX market evolution. Simul. Model. Pract. Theory 86: 1-10 (2018) - [c12]Martín González
A Parallel Application of Matheuristics in Data Envelopment Analysis. DCAI 2018: 172-179 - [c11]Alfonso L. Castaño, Javier Cuenca
Parallelism on Hybrid Metaheuristics for Vector Autoregression Models. HPCS 2018: 828-835 - 2017
- [c10]Martín González
A parameterized scheme of metaheuristics with exact methods for determining the Principle of Least Action in Data Envelopment Analysis. CEC 2017: 588-595 - [i1]Alfonso L. Castaño, Javier Cuenca, Domingo Giménez, Jose-Juan López-Espín, Alberto Pérez-Bernabeu:
Obtaining the coefficients of a Vector Autoregression Model through minimization of parameter criteria. CoRR abs/1711.09369 (2017) - 2015
- [c9]Martín González
Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis. ICCS 2015: 374-383 - 2014
- [j7]Juan Aparicio
Benchmarking in Data Envelopment Analysis: An Approach Based on Genetic Algorithms and Parallel Programming. Adv. Oper. Res. 2014: 431749:1-431749:9 (2014) - [j6]Jose-Juan López-Espín
Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree. J. Comput. Appl. Math. 255: 605-615 (2014) - [c8]Jose-Juan López-Espín
Benchmarking and Data Envelopment Analysis. An Approach based on Metaheuristics. ICCS 2014: 390-399 - 2013
- [j5]Antonio Peñalver Benavent, Jose-Juan López-Espín, Federico Botella, José A. Gallud:
Defining Distribution Constraints in Distributed User Interfaces. J. Univers. Comput. Sci. 19(6): 831-850 (2013) - [j4]Francisco Almeida
Parameterized Schemes of Metaheuristics: Basic Ideas and Applications With Genetic Algorithms, Scatter Search, and GRASP. IEEE Trans. Syst. Man Cybern. Syst. 43(3): 570-586 (2013) - [c7]Raul Martinez-Moreno, Jose-Juan López-Espín
Application of Genetic Algorithms to Determine Closest Targets in Data Envelopment Analysis. DCAI 2013: 111-119 - 2012
- [j3]José A. Gallud
A Proposal to Validate the User's Goal in Distributed User Interfaces. Int. J. Hum. Comput. Interact. 28(11): 700-708 (2012) - [j2]Jose-Juan López-Espín
Two-stage least squares and indirect least squares algorithms for simultaneous equations models. J. Comput. Appl. Math. 236(15): 3676-3684 (2012) - [c6]Antonio Peñalver Benavent
Schema driven distributed user interface generation. Interacción 2012: 1:1-1:8 - [c5]Carla Ramiro, Jose-Juan López-Espín
Two-Stage Least Squares Algorithms with QR Decomposition for Simultaneous Equations Models on Heterogeneous Multicore and Multi-GPU Systems. ICCS 2012: 2004-2007 - 2011
- [j1]Francisco Almeida
A parameterized shared-memory scheme for parameterized metaheuristics. J. Supercomput. 58(3): 292-301 (2011) - [c4]Francisco Almeida
Obtaining Simultaneous Equation Models through a Unified Shared-Memory Scheme of Metaheuristics. IPDPS Workshops 2011: 1981-1988 - [p1]Antonio Peñalver Benavent, Jose-Juan López-Espín, José A. Gallud, Enrique Lazcorreta, Federico Botella:
Distributed User Interfaces: Specification of Essential Properties. Distributed User Interfaces 2011: 13-21 - 2010
- [c3]Jose-Juan López-Espín
Obtaining simultaneous equation models from a set of variables through genetic algorithms. ICCS 2010: 427-435
2000 – 2009
- 2007
- [c2]Javier Cuenca
A proposal of metaheuristics to schedule independent tasks in heterogeneous memory-constrained systems. CLUSTER 2007: 422-427 - [c1]Jose-Juan López-Espín
Message-Passing Two Steps Least Square Algorithms for Simultaneous Equations Models. PPAM 2007: 127-136
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-04-25 05:49 CEST 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: