Belen Martin-Barragan

Orcid: 0000-0003-4807-2700

Affiliations:
  • University of Edinburgh, Edinburgh, UK


According to our database1, Belen Martin-Barragan authored at least 20 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Interpretable machine learning for imbalanced credit scoring datasets.
Eur. J. Oper. Res., January, 2024

2023
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand.
Eur. J. Oper. Res., 2023

The stochastic inventory routing problem on electric roads.
Eur. J. Oper. Res., 2023

2021
On sparse ensemble methods: An application to short-term predictions of the evolution of COVID-19.
Eur. J. Oper. Res., 2021

A projection multi-objective SVM method for multi-class classification.
Comput. Ind. Eng., 2021

2020
Selection of time instants and intervals with Support Vector Regression for multivariate functional data.
Comput. Oper. Res., 2020

2019
Variable selection in classification for multivariate functional data.
Inf. Sci., 2019

The Dynamic Bowser Routing Problem.
Eur. J. Oper. Res., 2019

Functional-bandwidth kernel for Support Vector Machine with Functional Data: An alternating optimization algorithm.
Eur. J. Oper. Res., 2019

2018
Computing non-stationary (<i>s, S</i>) policies using mixed integer linear programming.
Eur. J. Oper. Res., 2018

2017
A simple heuristic for perishable item inventory control under non-stationary stochastic demand.
Int. J. Prod. Res., 2017

2014
Interpretable support vector machines for functional data.
Eur. J. Oper. Res., 2014

A nested heuristic for parameter tuning in Support Vector Machines.
Comput. Oper. Res., 2014

2011
Maximizing upgrading and downgrading margins for ordinal regression.
Math. Methods Oper. Res., 2011

Detecting relevant variables and interactions in supervised classification.
Eur. J. Oper. Res., 2011

2010
Binarized Support Vector Machines.
INFORMS J. Comput., 2010

2008
Multi-group support vector machines with measurement costs: A biobjective approach.
Discret. Appl. Math., 2008

2007
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification.
INFORMS J. Comput., 2007

2006
Two-group classification via a biobjective margin maximization model.
Eur. J. Oper. Res., 2006

2004
A Biobjective Model to Select Features with Good Classification Quality and Low Cost.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004


  Loading...