Marina Leal

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Mixed-integer models for complete-linkage clustering.
Ann. Oper. Res.
Martine Labbé, Mercedes Landete, Marina Leal, Lorena Nácher
2025 J jnl
The Capacitated Vehicle Routing Problem with Planned Downtime.
Comput. Optim. Appl.
Mercedes Landete, Marina Leal, Juan Francisco Monge, Inmaculada Rodríguez Martín
2023 J jnl
Dendrograms, minimum spanning trees and feature selection.
Eur. J. Oper. Res.
Martine Labbé, Mercedes Landete, Marina Leal
2022 J jnl
On linear bilevel optimization problems with complementarity-constrained lower levels.
J. Oper. Res. Soc.
Steven A. Gabriel, Marina Leal, Martin Schmidt
2021 J jnl
A robust optimization model for distribution network design under a mixed integer set of scenarios.
Comput. Oper. Res.
Eduardo Conde, Marina Leal
2021 J jnl
Solving binary-constrained mixed complementarity problems using continuous reformulations.
Comput. Oper. Res.
Steven A. Gabriel, Marina Leal, Martin Schmidt
2020 J jnl
Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs.
Eur. J. Oper. Res.
Marina Leal, Diego Ponce, Justo Puerto
2019 J jnl
New models for the location of
Comput. Oper. Res.
Martine Labbé, Marina Leal, Justo Puerto
2018 J jnl
A minmax regret version of the time-dependent shortest path problem.
Eur. J. Oper. Res.
Eduardo Conde, Marina Leal, Justo Puerto
2018 J jnl
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.
Discret. Appl. Math.
Igor Averbakh, Oded Berman, Marina Leal
2017 J jnl
Minmax regret combinatorial optimization problems with investments.
Comput. Oper. Res.
Eduardo Conde, Marina Leal