Minmax regret combinatorial optimization problems with investments. - Eduardo Conde; Marina Leal (Comput. Oper. Res., 2017)

Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. - Igor Averbakh; Oded Berman; Marina Leal (Discret. Appl. Math., 2018)

A minmax regret version of the time-dependent shortest path problem. - Eduardo Conde; Marina Leal; Justo Puerto (Eur. J. Oper. Res., 2018)

New models for the location of controversial facilities: A bilevel programming approach. - Martine Labbé; Marina Leal; Justo Puerto (Comput. Oper. Res., 2019)

Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs. - Marina Leal; Diego Ponce; Justo Puerto (Eur. J. Oper. Res., 2020)

A robust optimization model for distribution network design under a mixed integer set of scenarios. - Eduardo Conde; Marina Leal (Comput. Oper. Res., 2021)

Solving binary-constrained mixed complementarity problems using continuous reformulations. - Steven A. Gabriel; Marina Leal; Martin Schmidt 003 (Comput. Oper. Res., 2021)

On linear bilevel optimization problems with complementarity-constrained lower levels. - Steven A. Gabriel; Marina Leal; Martin Schmidt 003 (J. Oper. Res. Soc., 2022)

Dendrograms, minimum spanning trees and feature selection. - Martine Labbé; Mercedes Landete; Marina Leal (Eur. J. Oper. Res., 2023)