default search action
Eduardo Conde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Stefano Benati, Eduardo Conde
:
A robust ordered weighted averaging loss model for portfolio optimization. Comput. Oper. Res. 167: 106666 (2024) - 2023
- [j30]Eduardo Conde
An orness based decision support model to aggregate ordered costs. Expert Syst. Appl. 221: 119715 (2023) - 2022
- [j29]Stefano Benati
A relative robust approach on expected returns with bounded CVaR for portfolio selection. Eur. J. Oper. Res. 296(1): 332-352 (2022) - 2021
- [j28]Eduardo Conde, Marina Leal
A robust optimization model for distribution network design under a mixed integer set of scenarios. Comput. Oper. Res. 136: 105493 (2021)
2010 – 2019
- 2019
- [j27]Eduardo Conde
Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios. Comput. Oper. Res. 103: 97-108 (2019) - 2018
- [j26]Eduardo Conde
A minmax regret version of the time-dependent shortest path problem. Eur. J. Oper. Res. 270(3): 968-981 (2018) - 2017
- [j25]Eduardo Conde
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions. Comput. Oper. Res. 77: 11-19 (2017) - [j24]Eduardo Conde
Minmax regret combinatorial optimization problems with investments. Comput. Oper. Res. 85: 1-11 (2017) - 2014
- [j23]Eduardo Conde
A Minmax Regret Linear Regression Model Under Uncertainty in the Dependent Variable. J. Optim. Theory Appl. 160(2): 573-596 (2014) - [j22]Eduardo Conde
A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines. Optim. Lett. 8(4): 1577-1589 (2014) - 2013
- [j21]Eduardo Conde
A minmax regret median problem on a tree under uncertain locations of the demand points. Oper. Res. Lett. 41(6): 602-606 (2013) - 2012
- [j20]Eduardo Conde
On a constant factor approximation for minmax regret problems using a symmetry point scenario. Eur. J. Oper. Res. 219(2): 452-457 (2012) - 2010
- [j19]Eduardo Conde
A linear optimization problem to derive relative weights using an interval judgement matrix. Eur. J. Oper. Res. 201(2): 537-544 (2010) - [j18]Eduardo Conde
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38(4): 326-327 (2010)
2000 – 2009
- 2009
- [j17]Eduardo Conde
A minmax regret approach to the critical path method with task interval times. Eur. J. Oper. Res. 197(1): 235-242 (2009) - 2008
- [j16]Eduardo Conde
A note on the minmax regret centdian location on trees. Oper. Res. Lett. 36(2): 271-275 (2008) - 2007
- [j15]Eduardo Conde
Minmax regret location-allocation problem on a network under uncertainty. Eur. J. Oper. Res. 179(3): 1025-1039 (2007) - [j14]Eduardo Conde
Minimax regret spanning arborescences under uncertain costs. Eur. J. Oper. Res. 182(2): 561-577 (2007) - [j13]José Gordillo, Eduardo Conde
An HMM for detecting spam mail. Expert Syst. Appl. 33(3): 667-682 (2007) - [j12]Eduardo Conde
A Branch and Bound algorithm for the minimax regret spanning arborescence. J. Glob. Optim. 37(3): 467-480 (2007) - 2006
- [j11]Rafael Blanquero
Inferring Efficient Weights from Pairwise Comparison Matrices. Math. Methods Oper. Res. 64(2): 271-284 (2006) - 2005
- [j10]Eduardo Conde
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients. Oper. Res. Lett. 33(5): 481-485 (2005) - 2004
- [j9]Eduardo 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
- [j8]Emilio Carrizosa
A fractional model for locating semi-desirable facilities on networks. Eur. J. Oper. Res. 136(1): 67-80 (2002) - [j7]Eduardo Conde
Mean utility in the assurance region model. Eur. J. Oper. Res. 140(1): 93-103 (2002) - 2001
- [j6]Rafael Blanquero
Finding GM-estimators with global optimization techniques. J. Glob. Optim. 21(3): 223-237 (2001) - [j5]Emilio Carrizosa
Finding the principal points of a random variable. RAIRO Oper. Res. 35(3): 315-328 (2001)
1990 – 1999
- 1997
- [j4]Emilio Carrizosa
Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case. Math. Oper. Res. 22(2): 276-290 (1997) - [j3]Emilio Carrizosa
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case. Math. Oper. Res. 22(2): 291-300 (1997) - 1995
- [j2]Emilio Carrizosa
Planar point-objective location problems with nonconvex constraints: A geometrical construction. J. Glob. Optim. 6(1): 77-86 (1995) - 1993
- [j1]Emilio Carrizosa
Efficiency in Euclidean constrained location problems. Oper. Res. Lett. 14(5): 291-295 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: