Dolores Romero Morales

Orcid: 0000-0001-7945-1469

Affiliations:
  • Copenhagen Business School, Denmark


According to our database1, Dolores Romero Morales authored at least 46 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A new model for counterfactual analysis for functional data.
Adv. Data Anal. Classif., December, 2024

A binarization approach to model interactions between categorical predictors in Generalized Linear Models.
Appl. Intell., September, 2024

Generating collective counterfactual explanations in score-based classification via mathematical optimization.
Expert Syst. Appl., March, 2024

Guest editorial to the special issue of the 32nd European Conference on Operational Research in Espoo (Finland).
Eur. J. Oper. Res., 2024

Supervised feature compression based on counterfactual analysis.
Eur. J. Oper. Res., 2024

Mathematical optimization modelling for group counterfactual explanations.
Eur. J. Oper. Res., 2024

Counterfactual analysis and target setting in benchmarking.
Eur. J. Oper. Res., 2024

2023
On clustering and interpreting with rules by means of mathematical optimization.
Comput. Oper. Res., June, 2023

On mathematical optimization for clustering categories in contingency tables.
Adv. Data Anal. Classif., June, 2023

On optimal regression trees to detect critical intervals for multivariate functional data.
Comput. Oper. Res., April, 2023

2022
The tree based linear regression model for hierarchical categorical variables.
Expert Syst. Appl., 2022

On sparse optimal regression trees.
Eur. J. Oper. Res., 2022

2021
On clustering categories of categorical predictors in generalized linear models.
Expert Syst. Appl., 2021

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

Optimal randomized classification trees.
Comput. Oper. Res., 2021

2020
Sparsity in optimal randomized classification trees.
Eur. J. Oper. Res., 2020

2018
Visualizing data as objects by DC (difference of convex) optimization.
Math. Program., 2018

On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps.
Eur. J. Oper. Res., 2018

On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty.
Comput. Oper. Res., 2018

On Building Online Visualization Maps for News Data Streams by Means of Mathematical Optimization.
Big Data, 2018

2017
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach.
Comput. Oper. Res., 2017

2016
Strongly agree or strongly disagree?: Rating features in Support Vector Machines.
Inf. Sci., 2016

2015
An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management.
Comput. Oper. Res., 2015

2014
Heuristic approaches for support vector machines with the ramp loss.
Optim. Lett., 2014

Revenue deficiency under second-price auctions in a supply-chain setting.
Eur. J. Oper. Res., 2014

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

2013
Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management.
Transp. Sci., 2013

Supervised classification and mathematical optimization.
Comput. Oper. Res., 2013

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

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

Forecasting cancellation rates for services booking revenue management using data mining.
Eur. J. Oper. Res., 2010

2009
Existence of equilibria in a decentralized two-level supply chain.
Eur. J. Oper. Res., 2009

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

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.
INFORMS J. Comput., 2007

A biobjective method for sample allocation in stratified sampling.
Eur. J. Oper. Res., 2007

2006
On solving the multi-period single-sourcing problem under uncertainty.
Comput. Manag. Sci., 2006

2005
Integrated Lot Sizing in Serial Supply Chains with Production Capacities.
Manag. Sci., 2005

2004
Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case.
J. Heuristics, 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

2003
A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem.
Oper. Res., 2003

2001
Finding the principal points of a random variable.
RAIRO Oper. Res., 2001

Generating Experimental Data for the Generalized Assignment Problem.
Oper. Res., 2001

Combining Minsum And Minmax: A Goal Programming Approach.
Oper. Res., 2001

A probabilistic analysis of the multi-period single-sourcing problem.
Discret. Appl. Math., 2001

2000
A class of greedy algorithms for the generalized assignment problem.
Discret. Appl. Math., 2000


  Loading...