Juan Francisco Monge Ivars
Juan Francisco Monge Ivars
Dirección de correo verificada de umh.es
Título
Citado por
Citado por
Año
On stochastic dynamic programming for solving large-scale planning problems under uncertainty
MP Cristobal, LF Escudero, JF Monge
Computers & Operations Research 36 (8), 2418-2428, 2009
552009
WISCHE: A DSS for water irrigation scheduling
M Almiñana, LF Escudero, M Landete, JF Monge, A Rabasa, ...
Omega 38 (6), 492-500, 2010
422010
Design and analysis of hybrid metaheuristics for the reliability p-median problem
J Alcaraz, M Landete, JF Monge
European Journal of Operational Research 222 (1), 54-64, 2012
272012
On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty
LF Escudero, JF Monge, DR Morales
Computers & Operations Research 100, 270-286, 2018
242018
Expected future value decomposition based bid price generation for large-scale network revenue management
LF Escudero, JF Monge, DR Morales, J Wang
Transportation Science 47 (2), 181-197, 2013
232013
On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management
LF Escudero, MA Garín, JF Monge, A Unzueta
Computers & Operations Research 98, 84-102, 2018
192018
A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
J Aparicio, M Landete, JF Monge, I Sirvent
Top 16 (2), 319-344, 2008
172008
Robust DEA efficiency scores: A probabilistic/combinatorial approach
M Landete, JF Monge, JL Ruiz
Expert Systems with Applications 86, 145-154, 2017
162017
Strengthening the reliability fixed-charge location model using clique constraints
J Alcaraz, M Landete, JF Monge, JL Sainz-Pardo
Computers & Operations Research 60, 14-26, 2015
162015
On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0–1 problems under uncertainty
U Aldasoro, LF Escudero, M Merino, JF Monge, G Pérez
Top 23 (3), 703-742, 2015
152015
An SDP approach for multiperiod mixed 0–1 linear programming models with stochastic dominance constraints for risk management
LF Escudero, JF Monge, DR Morales
Computers & Operations Research 58, 32-40, 2015
152015
On capacity expansion planning under strategic and operational uncertainties based on stochastic dominance risk averse management
LF Escudero, JF Monge
Computational Management Science 15 (3), 479-500, 2018
132018
Modeling CRS bounded additive DEA models and characterizing their Pareto-efficient points
JT Pastor, J Aparicio, JF Monge, D Pastor
Journal of Productivity Analysis 40 (3), 285-292, 2013
132013
On stochastic dynamic programming for solving large-scale tactical production planning problems
MP Cristobal, LF Escudero, JF Monge
Computers and Operations Research 36, 2418-2428, 2009
122009
On a mixed zero–one separable non-linear approach for water irrigation scheduling
M Alminana, LF Escudero, M Landete, JF Monge, A Rabasa, ...
IIE Transactions 40 (4), 398-405, 2008
112008
Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management
LF Escudero, MA Garín, JF Monge, A Unzueta
European Journal of Operational Research 285 (3), 988-1001, 2020
92020
Multi-objective evolutionary algorithms for a reliability location problem
J Alcaraz, M Landete, JF Monge, JL Sainz-Pardo
European Journal of Operational Research 283 (1), 83-93, 2020
92020
Introducing capacities in the location of unreliable facilities
M Albareda-Sambola, M Landete, JF Monge, JL Sainz-Pardo
European Journal of Operational Research 259 (1), 175-188, 2017
92017
An effective heuristic for multistage linear programming with a stochastic right-hand side
C Beltran-Royo, LF Escudero, JF Monge, RE Rodriguez-Ravines
Computers & operations research 51, 237-250, 2014
82014
A well-defined composite indicator: An application to corporate social responsibility
J Aparicio, M Kapelko, JF Monge
Journal of Optimization Theory and Applications 186 (1), 299-323, 2020
72020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20