| Multi-criteria analysis with partial information about the weighting coefficients E Carrizosa, E Conde, FR Fernandez, J Puerto European Journal of Operational Research 81 (2), 291-301, 1995 | 112 | 1995 |
| The generalized Weber problem with expected distances E Carrizosa, E Conde, M Munoz-Marquez, J Puerto RAIRO-Operations Research-Recherche Opérationnelle 29 (1), 35-57, 1995 | 72 | 1995 |
| An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion E Conde Mathematical Programming 100 (2), 345-353, 2004 | 51 | 2004 |
| Minmax regret location–allocation problem on a network under uncertainty E Conde European Journal of Operational Research 179 (3), 1025-1039, 2007 | 48 | 2007 |
| Semi-obnoxious location models: A global optimization approach D Romero-Morales, E Carrizosa, E Conde European Journal of Operational Research 102 (2), 295-301, 1997 | 45 | 1997 |
| A linear optimization problem to derive relative weights using an interval judgement matrix E Conde, MPR Pérez European Journal of Operational Research 201 (2), 537-544, 2010 | 42 | 2010 |
| Inferring efficient weights from pairwise comparison matrices R Blanquero, E Carrizosa, E Conde Mathematical Methods of Operations Research 64 (2), 271-284, 2006 | 37 | 2006 |
| Admission policies in loss queueing models with heterogeneous arrivals E Carrizosa, E Conde, M Munoz-Marquez Management Science 44 (3), 311-320, 1998 | 35 | 1998 |
| A minmax regret approach to the critical path method with task interval times E Conde European Journal of Operational Research 197 (1), 235-242, 2009 | 34 | 2009 |
| Efficiency in Euclidean constrained location problems E Carrizosa, E Conde, FR Fernandez, J Puerto Operations Research Letters 14 (5), 291-295, 1993 | 33 | 1993 |
| An HMM for detecting spam mail J Gordillo, E Conde Expert systems with applications 33 (3), 667-682, 2007 | 27 | 2007 |
| On a constant factor approximation for minmax regret problems using a symmetry point scenario E Conde European Journal of Operational Research 219 (2), 452-457, 2012 | 25 | 2012 |
| A note on the minmax regret centdian location on trees E Conde Operations Research Letters 36 (2), 271-275, 2008 | 24 | 2008 |
| Planar point-objective location problems with nonconvex constraints: a geometrical construction E Carrizosa, E Conde, M Muñoz-Marquez, J Puerto Journal of Global Optimization 6 (1), 77-86, 1995 | 23 | 1995 |
| A fractional model for locating semi-desirable facilities on networks E Carrizosa, E Conde European Journal of Operational Research 136 (1), 67-80, 2002 | 20 | 2002 |
| A 2-approximation for minmax regret problems via a mid-point scenario optimal solution E Conde Operations Research Letters 38 (4), 326-327, 2010 | 19 | 2010 |
| Location of a semiobnoxious facility. A biobjective approach E Carrizosa, E Conde, D Romero-Morales Advances in multiple objective and goal programming, 338-346, 1997 | 19 | 1997 |
| Simpson points in planar problems with locational constraints. The polyhedral-gauge case E Carrizosa, E Conde, M Muñoz-Márquez, J Puerto Mathematics of Operations Research 22 (2), 291-300, 1997 | 16 | 1997 |
| Closest solutions in ideal-point methods E Carrizosa, E Conde, A Pascual, D Romero-Morales Advances in multiple objective and goal programming, 274-281, 1997 | 13 | 1997 |
| Minimax regret spanning arborescences under uncertain costs E Conde, A Candia European Journal of Operational Research 182 (2), 561-577, 2007 | 12 | 2007 |
