dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Eduardo Conde Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: On a constant factor approximation for minmax regret problems using a symmetry point scenario. European Journal of Operational Research 219(2): 452-457 (2012)
2010
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde, María de la Paz Rivera Pérez: A linear optimization problem to derive relative weights using an interval judgement matrix. European Journal of Operational Research 201(2): 537-544 (2010)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38(4): 326-327 (2010)
2009
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: A minmax regret approach to the critical path method with task interval times. European Journal of Operational Research 197(1): 235-242 (2009)
2008
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: A note on the minmax regret centdian location on trees. Oper. Res. Lett. 36(2): 271-275 (2008)
2007
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: Minmax regret location-allocation problem on a network under uncertainty. European Journal of Operational Research 179(3): 1025-1039 (2007)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde, Alfredo Candia: Minimax regret spanning arborescences under uncertain costs. European Journal of Operational Research 182(2): 561-577 (2007)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosé Gordillo, Eduardo Conde: An HMM for detecting spam mail. Expert Syst. Appl. 33(3): 667-682 (2007)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: A Branch and Bound algorithm for the minimax regret spanning arborescence. J. Global Optimization 37(3): 467-480 (2007)
2005
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients. Oper. Res. Lett. 33(5): 481-485 (2005)
2004
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Program. 100(2): 345-353 (2004)
2002
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilio Carrizosa, Eduardo Conde: A fractional model for locating semi-desirable facilities on networks. European Journal of Operational Research 136(1): 67-80 (2002)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEduardo Conde: Mean utility in the assurance region model. European Journal of Operational Research 140(1): 93-103 (2002)
2001
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilio Carrizosa, Eduardo Conde, A. Castaño, Dolores Romero Morales: Finding the principal points of a random variable. RAIRO - Operations Research 35(3): 315-328 (2001)

Coauthor Index

1Alfredo Candia [8]
2Emilio Carrizosa [1] [3]
3A. Castaño [1]
4José Gordillo [7]
5Dolores Romero Morales [1]
6María de la Paz Rivera Pérez [13]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page