Marina Leal

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 9

Top Topics

Optimal Portfolio

Shortest Path Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Discret. Appl. Math.

J. Oper. Res. Soc.

Publications

Martine Labbé, Mercedes Landete, Marina Leal
Dendrograms, minimum spanning trees and feature selection. Eur. J. Oper. Res. 308 (2) (2023)
Steven A. Gabriel, Marina Leal, Martin Schmidt
On linear bilevel optimization problems with complementarity-constrained lower levels. J. Oper. Res. Soc. 73 (12) (2022)
Eduardo Conde, Marina Leal
A robust optimization model for distribution network design under a mixed integer set of scenarios. Comput. Oper. Res. 136 (2021)
Steven A. Gabriel, Marina Leal, Martin Schmidt
Solving binary-constrained mixed complementarity problems using continuous reformulations. Comput. Oper. Res. 131 (2021)
Marina Leal, Diego Ponce, Justo Puerto
Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs. Eur. J. Oper. Res. 284 (2) (2020)
Martine Labbé, Marina Leal, Justo Puerto
facilities: A bilevel programming approach. Comput. Oper. Res. 107 (2019)
Igor Averbakh, Oded Berman, Marina Leal
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. Discret. Appl. Math. 239 (2018)
Eduardo Conde, Marina Leal, Justo Puerto
A minmax regret version of the time-dependent shortest path problem. Eur. J. Oper. Res. 270 (3) (2018)
Eduardo Conde, Marina Leal
Minmax regret combinatorial optimization problems with investments. Comput. Oper. Res. 85 (2017)