Conde Sánchez, Eduardo Author

Robust minmax regret combinatorial optimization problems with a resource–dependent uncertainty polyhedron of scenarios

  • Conde E.

COMPUTERS and OPERATIONS RESEARCH - 1/3/2019

10.1016/j.cor.2018.10.014

Cite count: 7 (Web of Science) 5 (Scopus)

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

10.1016/j.cor.2021.105493

Cite count:

Minmax regret combinatorial optimization problems with investments

  • Conde E.
  • Leal M.

COMPUTERS and OPERATIONS RESEARCH - 1/9/2017

10.1016/j.cor.2017.03.007

Cite count: 5 (Web of Science) 4 (Scopus)

A minimum expected regret model for the shortest path problem with solution-dependent probability distributions

  • Conde E.

COMPUTERS and OPERATIONS RESEARCH - 1/1/2017

10.1016/j.cor.2016.07.007

Cite count: 6 (Web of Science) 4 (Scopus)

Mean utility in the assurance region model

  • Conde E.

European Journal of Operational Research - 1/7/2002

10.1016/s0377-2217(01)00220-x

Cite count: 1 (Web of Science) 1 (Scopus)

Minimax regret spanning arborescences under uncertain costs

  • Conde E.
  • Candia A.

European Journal of Operational Research - 16/10/2007

10.1016/j.ejor.2006.07.036

Cite count: 11 (Web of Science) 9 (Scopus)

Minmax regret location-allocation problem on a network under uncertainty

  • Conde E.

European Journal of Operational Research - 16/6/2007

10.1016/j.ejor.2005.11.040

Cite count: 30 (Web of Science) 29 (Scopus)

A minmax regret version of the time-dependent shortest path problem

  • Conde E.
  • Leal M.
  • Puerto J.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/11/2018

10.1016/j.ejor.2018.04.030

Cite count: 8 (Web of Science) 5 (Scopus)

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

Cite count: 26 (Web of Science) 28 (Scopus)

On a constant factor approximation for minmax regret problems using a symmetry point scenario

  • Conde E.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/6/2012

10.1016/j.ejor.2012.01.005

Cite count: 16 (Web of Science) 16 (Scopus)

This author has no books, chapters or theses.

A MANAGEMENT TOOL FOR INDICATOR-SUPPORTED SYSTEMS - A PUBLIC-HEALTH SERVICE APPLICATION

  • CARRIZOSA, E
  • CONDE, E
  • FERNANDEZ, FR
  • PUERTO, J

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 25/08/1992

10.1016/0377-2217(92)90281-d View source

Cite count: 2 (Web of Science) 3 (Scopus)

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

CONDITIONS FOR OPTIMIZATION IN DISCRETE SETS

  • CONDE, E
  • PUERTO, J
  • BRAUMANN, CA

FIFTEENTH PORTUGUESE-SPANISH CONFERENCE ON MATHEMATICS : PROCEEDINGS, VOLS 1-6 - 1991

Finding GM-estimators with global optimization techniques

  • Blanquero, R
  • Carrizosa, E
  • Conde, E

JOURNAL OF GLOBAL OPTIMIZATION - 1/11/2001

10.1023/a:1012327609645 View source

Cite count: 2 (Web of Science) 2 (Scopus)

This author has no patents.

This author has no reports or other types of publications.

Scopus: 15

Web of Science: 16

Scopus: 17

Web of Science: 21

Last data update: 2/24/24 7:13 AM
Next scheduled update: 3/2/24 3:00 AM