Eduardo Conde - RankMe

31 papers Journal 31

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	A robust ordered weighted averaging loss model for portfolio optimization. Comput. Oper. Res. Stefano Benati, Eduardo Conde
2023	J	`jnl`	An orness based decision support model to aggregate ordered costs. Expert Syst. Appl. Eduardo Conde
2022	J	`jnl`	A relative robust approach on expected returns with bounded CVaR for portfolio selection. Eur. J. Oper. Res. Stefano Benati, Eduardo Conde
2021	J	`jnl`	A robust optimization model for distribution network design under a mixed integer set of scenarios. Comput. Oper. Res. Eduardo Conde, Marina Leal
2019	J	`jnl`	Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios. Comput. Oper. Res. Eduardo Conde
2018	J	`jnl`	A minmax regret version of the time-dependent shortest path problem. Eur. J. Oper. Res. Eduardo Conde, Marina Leal, Justo Puerto
2017	J	`jnl`	A minimum expected regret model for the shortest path problem with solution-dependent probability distributions. Comput. Oper. Res. Eduardo Conde
2017	J	`jnl`	Minmax regret combinatorial optimization problems with investments. Comput. Oper. Res. Eduardo Conde, Marina Leal
2014	J	`jnl`	A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines. Optim. Lett. Eduardo Conde
2014	J	`jnl`	A Minmax Regret Linear Regression Model Under Uncertainty in the Dependent Variable. J. Optim. Theory Appl. Eduardo Conde
2013	J	`jnl`	A minmax regret median problem on a tree under uncertain locations of the demand points. Oper. Res. Lett. Eduardo Conde
2012	J	`jnl`	On a constant factor approximation for minmax regret problems using a symmetry point scenario. Eur. J. Oper. Res. Eduardo Conde
2010	J	`jnl`	A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. Eduardo Conde
2010	J	`jnl`	A linear optimization problem to derive relative weights using an interval judgement matrix. Eur. J. Oper. Res. Eduardo Conde, María de la Paz Rivera Pérez
2009	J	`jnl`	A minmax regret approach to the critical path method with task interval times. Eur. J. Oper. Res. Eduardo Conde
2008	J	`jnl`	A note on the minmax regret centdian location on trees. Oper. Res. Lett. Eduardo Conde
2007	J	`jnl`	A Branch and Bound algorithm for the minimax regret spanning arborescence. J. Glob. Optim. Eduardo Conde
2007	J	`jnl`	An HMM for detecting spam mail. Expert Syst. Appl. José Gordillo, Eduardo Conde
2007	J	`jnl`	Minimax regret spanning arborescences under uncertain costs. Eur. J. Oper. Res. Eduardo Conde, Alfredo Candia
2007	J	`jnl`	Minmax regret location-allocation problem on a network under uncertainty. Eur. J. Oper. Res. Eduardo Conde
2006	J	`jnl`	Inferring Efficient Weights from Pairwise Comparison Matrices. Math. Methods Oper. Res. Rafael Blanquero, Emilio Carrizosa, Eduardo Conde
2005	J	`jnl`	On the complexity of the continuous unbounded knapsack problem with uncertain coefficients. Oper. Res. Lett. Eduardo Conde
2004	J	`jnl`	An improved algorithm for selecting Math. Program. Eduardo Conde
2002	J	`jnl`	A fractional model for locating semi-desirable facilities on networks. Eur. J. Oper. Res. Emilio Carrizosa, Eduardo Conde
2002	J	`jnl`	Mean utility in the assurance region model. Eur. J. Oper. Res. Eduardo Conde
2001	J	`jnl`	Finding GM-estimators with global optimization techniques. J. Glob. Optim. Rafael Blanquero, Emilio Carrizosa, Eduardo Conde
2001	J	`jnl`	Finding the principal points of a random variable. RAIRO Oper. Res. Emilio Carrizosa, Eduardo Conde, Antonia Castaño, Dolores Romero Morales
1997	J	`jnl`	Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case. Math. Oper. Res. Emilio Carrizosa, Eduardo Conde, Manuel Muñoz-Márquez, Justo Puerto
1997	J	`jnl`	Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case. Math. Oper. Res. Emilio Carrizosa, Eduardo Conde, Manuel Muñoz-Márquez, Justo Puerto
1995	J	`jnl`	Planar point-objective location problems with nonconvex constraints: A geometrical construction. J. Glob. Optim. Emilio Carrizosa, Eduardo Conde, Manuel Muñoz-Márquez, Justo Puerto
1993	J	`jnl`	Efficiency in Euclidean constrained location problems. Oper. Res. Lett. Emilio Carrizosa, Eduardo Conde, Francisco R. Fernández, Justo Puerto