default search action
Belen Martin-Barragan
Person information
- affiliation: University of Edinburgh, Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Yujia Chen
, Raffaella Calabrese, Belen Martin-Barragan
Interpretable machine learning for imbalanced credit scoring datasets. Eur. J. Oper. Res. 312(1): 357-372 (2024) - 2023
- [j18]Mengyuan Xiang, Roberto Rossi
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand. Eur. J. Oper. Res. 304(2): 515-524 (2023) - [j17]Alejandro Gutierrez Alcoba
The stochastic inventory routing problem on electric roads. Eur. J. Oper. Res. 310(1): 156-167 (2023) - 2021
- [j16]Ling Liu, Belén Martín-Barragán
A projection multi-objective SVM method for multi-class classification. Comput. Ind. Eng. 158: 107425 (2021) - [j15]Sandra Benítez-Peña
On sparse ensemble methods: An application to short-term predictions of the evolution of COVID-19. Eur. J. Oper. Res. 295(2): 648-663 (2021) - 2020
- [j14]Rafael Blanquero
Selection of time instants and intervals with Support Vector Regression for multivariate functional data. Comput. Oper. Res. 123: 105050 (2020)
2010 – 2019
- 2019
- [j13]Roberto Rossi
The Dynamic Bowser Routing Problem. Eur. J. Oper. Res. 275(1): 108-126 (2019) - [j12]Rafael Blanquero
Functional-bandwidth kernel for Support Vector Machine with Functional Data: An alternating optimization algorithm. Eur. J. Oper. Res. 275(1): 195-207 (2019) - [j11]Rafael Blanquero
Variable selection in classification for multivariate functional data. Inf. Sci. 481: 445-462 (2019) - 2018
- [j10]Mengyuan Xiang
Computing non-stationary (s, S) policies using mixed integer linear programming. Eur. J. Oper. Res. 271(2): 490-500 (2018) - 2017
- [j9]Alejandro Gutierrez Alcoba
A simple heuristic for perishable item inventory control under non-stationary stochastic demand. Int. J. Prod. Res. 55(7): 1885-1897 (2017) - 2014
- [j8]Emilio Carrizosa
A nested heuristic for parameter tuning in Support Vector Machines. Comput. Oper. Res. 43: 328-334 (2014) - [j7]Belen Martin-Barragan
Interpretable support vector machines for functional data. Eur. J. Oper. Res. 232(1): 146-155 (2014) - 2011
- [j6]Emilio Carrizosa
Detecting relevant variables and interactions in supervised classification. Eur. J. Oper. Res. 213(1): 260-269 (2011) - [j5]Emilio Carrizosa
Maximizing upgrading and downgrading margins for ordinal regression. Math. Methods Oper. Res. 74(3): 381-407 (2011) - 2010
- [j4]Emilio Carrizosa
Binarized Support Vector Machines. INFORMS J. Comput. 22(1): 154-167 (2010)
2000 – 2009
- 2008
- [j3]Emilio Carrizosa
Multi-group support vector machines with measurement costs: A biobjective approach. Discret. Appl. Math. 156(6): 950-966 (2008) - 2007
- [j2]Emilio Carrizosa
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification. INFORMS J. Comput. 19(3): 470-479 (2007) - 2006
- [j1]Emilio Carrizosa
Two-group classification via a biobjective margin maximization model. Eur. J. Oper. Res. 173(3): 746-761 (2006) - 2004
- [c1]Emilio Carrizosa
A Biobjective Model to Select Features with Good Classification Quality and Low Cost. ICDM 2004: 339-342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: