default search action
Juan F. Monge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j32]Alejandro Moya-Martínez
, Mercedes Landete
New models for close enough facility location problems. Comput. Oper. Res. 176: 106957 (2025) - 2024
- [j31]Pedro Ignacio Sáez
Determining the Safest Anchoring Knot in a Fall Arrest System by Means of Static Tests. Symmetry 16(2): 167 (2024) - 2023
- [j30]Jordi Castro
On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach. Eur. J. Oper. Res. 310(1): 268-285 (2023) - [j29]Maria Albareda-Sambola, Mercedes Landete
An exact approach for the reliable fixed-charge location problem with capacity constraints. Eur. J. Oper. Res. 311(1): 24-35 (2023) - [j28]Juan F. Monge
Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: A bi-level linear programming approach in Data Envelopment Analysis. Eur. J. Oper. Res. 311(3): 1084-1096 (2023) - 2022
- [j27]Juan Aparicio
The generalized range adjusted measure in data envelopment analysis: Properties, computational aspects and duality. Eur. J. Oper. Res. 302(2): 621-632 (2022) - [j26]Javier Alcaraz
Ranking ranges in cross-efficiency evaluations: A metaheuristic approach. J. Oper. Res. Soc. 73(4): 779-793 (2022) - [j25]Javier Alcaraz
The Concordance Test, an Alternative to Kruskal-Wallis Based on the Kendall-$\tau$ Distance: An R Package. R J. 14(2): 26-53 (2022) - 2021
- [j24]Javier Alcaraz
Russell Graph efficiency measures in Data Envelopment Analysis: The multiplicative approach. Eur. J. Oper. Res. 292(2): 663-674 (2021) - [j23]Juan Aparicio
A new measure of technical efficiency in data envelopment analysis based on the maximization of hypervolumes: Benchmarking, properties and computational aspects. Eur. J. Oper. Res. 293(1): 263-275 (2021) - 2020
- [j22]Juan Aparicio
A linear ordering problem of sets. Ann. Oper. Res. 288(1): 45-64 (2020) - [j21]Javier Alcaraz
Multi-objective evolutionary algorithms for a reliability location problem. Eur. J. Oper. Res. 283(1): 83-93 (2020) - [j20]Laureano F. Escudero, María Araceli Garín, Juan F. Monge
Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management. Eur. J. Oper. Res. 285(3): 988-1001 (2020) - [j19]Laureano F. Escudero, Juan F. Monge
On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty. Eur. J. Oper. Res. 287(1): 262-279 (2020) - [j18]Juan Aparicio
A Well-Defined Composite Indicator: An Application to Corporate Social Responsibility. J. Optim. Theory Appl. 186(1): 299-323 (2020) - [j17]Juan F. Monge
Equally weighted cardinality constrained portfolio selection via factor models. Optim. Lett. 14(8): 2515-2538 (2020)
2010 – 2019
- 2018
- [j16]Laureano F. Escudero
On capacity expansion planning under strategic and operational uncertainties based on stochastic dominance risk averse management. Comput. Manag. Sci. 15(3-4): 479-500 (2018) - [j15]Laureano F. Escudero, María Araceli Garín, Juan F. Monge
On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management. Comput. Oper. Res. 98: 84-102 (2018) - [j14]Laureano F. Escudero
On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty. Comput. Oper. Res. 100: 270-286 (2018) - 2017
- [j13]Maria Albareda-Sambola
Introducing capacities in the location of unreliable facilities. Eur. J. Oper. Res. 259(1): 175-188 (2017) - [j12]Mercedes Landete
Robust DEA efficiency scores: A probabilistic/combinatorial approach. Expert Syst. Appl. 86: 145-154 (2017) - [j11]José L. Sainz-Pardo
On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem. J. Glob. Optim. 67(4): 787-804 (2017) - [j10]Eva M. García-Nové, Javier Alcaraz
Rank aggregation in cyclic sequences. Optim. Lett. 11(4): 667-678 (2017) - 2015
- [j9]Laureano F. Escudero
An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management. Comput. Oper. Res. 58: 32-40 (2015) - [j8]Javier Alcaraz
Strengthening the reliability fixed-charge location model using clique constraints. Comput. Oper. Res. 60: 14-26 (2015) - 2014
- [j7]Cesar Beltran-Royo
An effective heuristic for multistage linear programming with a stochastic right-hand side. Comput. Oper. Res. 51: 237-250 (2014) - 2013
- [j6]Mercedes Landete
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem. Ann. Oper. Res. 207(1): 137-160 (2013) - [j5]Laureano F. Escudero
Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management. Transp. Sci. 47(2): 181-197 (2013) - 2012
- [j4]Javier Alcaraz
Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem. Eur. J. Oper. Res. 222(1): 54-64 (2012) - [j3]Javier Amorós, Laureano F. Escudero
TEAM ASPAR Uses Binary Optimization to Obtain Optimal Gearbox Ratios in Motorcycle Racing. Interfaces 42(2): 191-198 (2012)
2000 – 2009
- 2009
- [j2]M. Pilar Cristobal, Laureano F. Escudero
On stochastic dynamic programming for solving large-scale planning problems under uncertainty. Comput. Oper. Res. 36(8): 2418-2428 (2009) - 2007
- [j1]Marc Almiñana, Laureano F. Escudero, Juan F. Monge
On the enrouting protocol problem under uncertainty. Eur. J. Oper. Res. 181(2): 887-902 (2007)
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 2025-03-04 21:22 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: