Eduardo Conde

Orcid: 0000-0001-5369-8463

According to our database1, Eduardo Conde authored at least 31 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A robust ordered weighted averaging loss model for portfolio optimization.
Comput. Oper. Res., 2024

2023
An orness based decision support model to aggregate ordered costs.
Expert Syst. Appl., July, 2023

2022
A relative robust approach on expected returns with bounded CVaR for portfolio selection.
Eur. J. Oper. Res., 2022

2021
A robust optimization model for distribution network design under a mixed integer set of scenarios.
Comput. Oper. Res., 2021

2019
Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios.
Comput. Oper. Res., 2019

2018
A minmax regret version of the time-dependent shortest path problem.
Eur. J. Oper. Res., 2018

2017
Minmax regret combinatorial optimization problems with investments.
Comput. Oper. Res., 2017

A minimum expected regret model for the shortest path problem with solution-dependent probability distributions.
Comput. Oper. Res., 2017

2014
A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines.
Optim. Lett., 2014

A Minmax Regret Linear Regression Model Under Uncertainty in the Dependent Variable.
J. Optim. Theory Appl., 2014

2013
A minmax regret median problem on a tree under uncertain locations of the demand points.
Oper. Res. Lett., 2013

2012
On a constant factor approximation for minmax regret problems using a symmetry point scenario.
Eur. J. Oper. Res., 2012

2010
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution.
Oper. Res. Lett., 2010

A linear optimization problem to derive relative weights using an interval judgement matrix.
Eur. J. Oper. Res., 2010

2009
A minmax regret approach to the critical path method with task interval times.
Eur. J. Oper. Res., 2009

2008
A note on the minmax regret centdian location on trees.
Oper. Res. Lett., 2008

2007
A Branch and Bound algorithm for the minimax regret spanning arborescence.
J. Glob. Optim., 2007

An HMM for detecting spam mail.
Expert Syst. Appl., 2007

Minimax regret spanning arborescences under uncertain costs.
Eur. J. Oper. Res., 2007

Minmax regret location-allocation problem on a network under uncertainty.
Eur. J. Oper. Res., 2007

2006
Inferring Efficient Weights from Pairwise Comparison Matrices.
Math. Methods Oper. Res., 2006

2005
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients.
Oper. Res. Lett., 2005

2004
An improved algorithm for selecting <i>p</i> items with uncertain returns according to the minmax-regret criterion.
Math. Program., 2004

2002
Mean utility in the assurance region model.
Eur. J. Oper. Res., 2002

A fractional model for locating semi-desirable facilities on networks.
Eur. J. Oper. Res., 2002

2001
Finding the principal points of a random variable.
RAIRO Oper. Res., 2001

Finding GM-estimators with global optimization techniques.
J. Glob. Optim., 2001

1997
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case.
Math. Oper. Res., 1997

Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case.
Math. Oper. Res., 1997

1995
Planar point-objective location problems with nonconvex constraints: A geometrical construction.
J. Glob. Optim., 1995

1993
Efficiency in Euclidean constrained location problems.
Oper. Res. Lett., 1993


  Loading...