Juan F. Monge

Orcid: 0000-0003-1224-1867

According to our database1, Juan F. Monge authored at least 31 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Determining the Safest Anchoring Knot in a Fall Arrest System by Means of Static Tests.
Symmetry, February, 2024

2023
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., December, 2023

An exact approach for the reliable fixed-charge location problem with capacity constraints.
Eur. J. Oper. Res., November, 2023

On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach.
Eur. J. Oper. Res., 2023

2022
The Concordance Test, an Alternative to Kruskal-Wallis Based on the Kendall-$\tau$ Distance: An R Package.
R J., 2022

Ranking ranges in cross-efficiency evaluations: A metaheuristic approach.
J. Oper. Res. Soc., 2022

The generalized range adjusted measure in data envelopment analysis: Properties, computational aspects and duality.
Eur. J. Oper. Res., 2022

2021
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., 2021

Russell Graph efficiency measures in Data Envelopment Analysis: The multiplicative approach.
Eur. J. Oper. Res., 2021

2020
Equally weighted cardinality constrained portfolio selection via factor models.
Optim. Lett., 2020

A Well-Defined Composite Indicator: An Application to Corporate Social Responsibility.
J. Optim. Theory Appl., 2020

On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty.
Eur. J. Oper. Res., 2020

Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management.
Eur. J. Oper. Res., 2020

Multi-objective evolutionary algorithms for a reliability location problem.
Eur. J. Oper. Res., 2020

A linear ordering problem of sets.
Ann. Oper. Res., 2020

2018
On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty.
Comput. Oper. Res., 2018

On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management.
Comput. Oper. Res., 2018

On capacity expansion planning under strategic and operational uncertainties based on stochastic dominance risk averse management.
Comput. Manag. Sci., 2018

2017
Rank aggregation in cyclic sequences.
Optim. Lett., 2017

On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem.
J. Glob. Optim., 2017

Robust DEA efficiency scores: A probabilistic/combinatorial approach.
Expert Syst. Appl., 2017

Introducing capacities in the location of unreliable facilities.
Eur. J. Oper. Res., 2017

2015
An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management.
Comput. Oper. Res., 2015

Strengthening the reliability fixed-charge location model using clique constraints.
Comput. Oper. Res., 2015

2014
An effective heuristic for multistage linear programming with a stochastic right-hand side.
Comput. Oper. Res., 2014

2013
Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management.
Transp. Sci., 2013

Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem.
Ann. Oper. Res., 2013

2012
TEAM ASPAR Uses Binary Optimization to Obtain Optimal Gearbox Ratios in Motorcycle Racing.
Interfaces, 2012

Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem.
Eur. J. Oper. Res., 2012

2009
On stochastic dynamic programming for solving large-scale planning problems under uncertainty.
Comput. Oper. Res., 2009

2007
On the enrouting protocol problem under uncertainty.
Eur. J. Oper. Res., 2007


  Loading...