Conde Sánchez, Eduardo Author
Minimax regret spanning arborescences under uncertain costs
- Conde E.
- Candia A.
European Journal of Operational Research - 16/10/2007
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 1.623 (2007
- SNIP: 1.982 (2007
- SJR Categories: Information Systems and Management (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
- Scopus
- ORCID
- Web of Science
Minmax regret location-allocation problem on a network under uncertainty
- Conde E.
European Journal of Operational Research - 16/6/2007
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 1.623 (2007
- SNIP: 1.982 (2007
- SJR Categories: Information Systems and Management (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
- Scopus
- ORCID
- Web of Science
Semi-obnoxious location models: A global optimization approach
- RomeroMorales, D
- Carrizosa, E
- Conde, E
European Journal of Operational Research - 16/10/1997
10.1016/s0377-2217(97)00110-0 View source
- CiteScore: 9.5 (2020)
- Scopus
- ORCID
- Web of Science
Mean utility in the assurance region model
- Conde E.
European Journal of Operational Research - 1/7/2002
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 0.927 (2002
- SNIP: 1.338 (2002
- SJR Categories: Information Systems and Management (Q1); Modeling and Simulation (Q1); Management Science and Operations Research (Q2)
- Scopus
- ORCID
- Web of Science
A fractional model for locating semi-desirable facilities on networks
- Carrizosa, E
- Conde, E
European Journal of Operational Research - 1/01/2002
10.1016/s0377-2217(01)00030-3 View source
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 0.927 (2002
- SNIP: 1.338 (2002
- SJR Categories: Information Systems and Management (Q1); Modeling and Simulation (Q1); Management Science and Operations Research (Q2)
- Scopus
- ORCID
- Web of Science
Robust minmax regret combinatorial optimization problems with a resource–dependent uncertainty polyhedron of scenarios
- Conde E.
Computers & Operations Research - 1/03/2019
- SJR Quartile: Q1
- JCR Impact Factor: 3.424 (2019)
- CiteScore: 8.2 (2020)
- SJR: 1.663 (2019
- SNIP: 2.219 (2019
- JCR 5-year Impact Factor: 3.804
- JCR Categories: OPERATIONS RESEARCH & MANAGEMENT SCIENCE
- SJR Categories: Computer Science (miscellaneous) (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
- Scopus
- ORCID
- Web of Science
A robust optimization model for distribution network design under a mixed integer set of scenarios
- Conde E.
- Leal M.
COMPUTERS and OPERATIONS RESEARCH - 1/12/2021
- JCR Impact Factor: 5.159 (2021)
- CiteScore: 8.2 (2020)
- SJR: 1.506 (2020
- SNIP: 2.237 (2020
- JCR 5-year Impact Factor: 5.211
- JCR Categories: ENGINEERING, INDUSTRIAL
A robust ordered weighted averaging loss model for portfolio optimization
- Stefano Benati
- Eduardo Conde
Computers and Operations Research - 1/7/2024
- CiteScore: 8.3 (2022)
- SJR: 1.716 (2022
- SNIP: 2.022 (2022
- Scopus
- ORCID
A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Conde E.
Computers and Operations Research - 1/1/2017
- SJR Quartile: Q1
- JCR Impact Factor: 2.962 (2017)
- CiteScore: 8.2 (2020)
- SJR: 1.916 (2017
- SNIP: 2.105 (2017
- JCR 5-year Impact Factor: 3.174
- JCR Categories: COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
- SJR Categories: Computer Science (miscellaneous) (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
- Scopus
- ORCID
- Web of Science
Minmax regret combinatorial optimization problems with investments
- Conde E.
- Leal M.
Computers and Operations Research - 1/9/2017
- SJR Quartile: Q1
- JCR Impact Factor: 2.962 (2017)
- CiteScore: 8.2 (2020)
- SJR: 1.916 (2017
- SNIP: 2.105 (2017
- JCR 5-year Impact Factor: 3.174
- JCR Categories: COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
- SJR Categories: Computer Science (miscellaneous) (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
- Scopus
- ORCID
- Web of Science
This author has no books, chapters or theses.
BRANCH AND BOUND ALGORITHM FOR DISCRETE FRACTIONAL-PROGRAMMING
- CONDE, E
- CANALES, PR
- BRAUMANN, CA
FIFTEENTH PORTUGUESE-SPANISH CONFERENCE ON MATHEMATICS : PROCEEDINGS, VOLS 1-6 - 1991
This author has no patents.
h index
Scopus: 15
Web of Science: 16
i10 index
Scopus: 17
Web of Science: 22
Author profiles
-
ORCID
-
Web of Science ResearcherID
-
Scopus Author ID
-
Dialnet id
-
Google Scholar Id
Research projects at UAL
-
Acronym MTM2004-20220-ESince: June 1, 2005Until: December 1, 2005Funded by: MECFunding / grant amount: 7,000.00 EURRole: Investigador
-
Acronym HH2004-0014Since: January 1, 2005Until: December 31, 2006Funded by: MECFunding / grant amount: 8,000.00 EURRole: Investigador