default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDolores Romero Morales
Person information
- affiliation: Copenhagen Business School, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Emilio Carrizosa, Marcela Galvis Restrepo
, Dolores Romero Morales:
A binarization approach to model interactions between categorical predictors in Generalized Linear Models. Appl. Intell. 54(17-18): 7969-7981 (2024)- [j43]Peter Bogetoft, Jasone Ramírez-Ayerbe, Dolores Romero Morales:
Counterfactual analysis and target setting in benchmarking. Eur. J. Oper. Res. 315(3): 1083-1095 (2024) - [j42]Veronica Piccialli, Dolores Romero Morales, Cecilia Salvatore:
Supervised feature compression based on counterfactual analysis. Eur. J. Oper. Res. 317(2): 273-285 (2024) - [j41]Antti Punkka, Dolores Romero Morales:
Guest editorial to the special issue of the 32nd European Conference on Operational Research in Espoo (Finland). Eur. J. Oper. Res. 319(2): 345-346 (2024) - [j40]Emilio Carrizosa, Jasone Ramírez-Ayerbe, Dolores Romero Morales:
Mathematical optimization modelling for group counterfactual explanations. Eur. J. Oper. Res. 319(2): 399-412 (2024) - [j39]Emilio Carrizosa, Jasone Ramírez-Ayerbe, Dolores Romero Morales:
Generating collective counterfactual explanations in score-based classification via mathematical optimization. Expert Syst. Appl. 238(Part E): 121954 (2024) - 2023
- [j38]Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
On mathematical optimization for clustering categories in contingency tables. Adv. Data Anal. Classif. 17(2): 407-429 (2023) - [j37]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
On optimal regression trees to detect critical intervals for multivariate functional data. Comput. Oper. Res. 152: 106152 (2023) - [j36]Emilio Carrizosa, Kseniia Kurishchenko, Alfredo Marín, Dolores Romero Morales:
On clustering and interpreting with rules by means of mathematical optimization. Comput. Oper. Res. 154: 106180 (2023) - [i5]Emilio Carrizosa, Jasone Ramírez-Ayerbe, Dolores Romero Morales:
Generating collective counterfactual explanations in score-based classification via mathematical optimization. CoRR abs/2310.12822 (2023) - 2022
- [j35]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
On sparse optimal regression trees. Eur. J. Oper. Res. 299(3): 1045-1054 (2022) - [j34]Emilio Carrizosa, Laust Hvas Mortensen, Dolores Romero Morales, M. Remedios Sillero-Denamiel:
The tree based linear regression model for hierarchical categorical variables. Expert Syst. Appl. 203: 117423 (2022) - [i4]Veronica Piccialli, Dolores Romero Morales, Cecilia Salvatore:
Supervised Feature Compression based on Counterfactual Analysis. CoRR abs/2211.09894 (2022) - 2021
- [j33]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
Optimal randomized classification trees. Comput. Oper. Res. 132: 105281 (2021) - [j32]Sandra Benítez-Peña, Emilio Carrizosa, Vanesa Guerrero, María-Dolores Jiménez-Gamero, Belén Martín-Barragán, Cristina Molero-Río, Pepa Ramírez-Cobo, Dolores Romero Morales, M. Remedios Sillero-Denamiel:
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) - [j31]Emilio Carrizosa, Marcela Galvis Restrepo, Dolores Romero Morales:
On clustering categories of categorical predictors in generalized linear models. Expert Syst. Appl. 182: 115245 (2021) - [i3]Emilio Carrizosa, Marcela Galvis Restrepo, Dolores Romero Morales:
On Clustering Categories of Categorical Predictors in Generalized Linear Models. CoRR abs/2110.10059 (2021) - [i2]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
Optimal randomized classification trees. CoRR abs/2110.11952 (2021) - 2020
- [j30]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
Sparsity in optimal randomized classification trees. Eur. J. Oper. Res. 284(1): 255-272 (2020) - [i1]Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
Sparsity in Optimal Randomized Classification Trees. CoRR abs/2002.09191 (2020)
2010 – 2019
- 2018
- [j29]Emilio Carrizosa, Vanesa Guerrero, Daniel Hardt, Dolores Romero Morales:
On Building Online Visualization Maps for News Data Streams by Means of Mathematical Optimization. Big Data 6(2): 139-158 (2018) - [j28]Laureano F. Escudero, Juan Francisco Monge, Dolores Romero Morales:
On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty. Comput. Oper. Res. 100: 270-286 (2018) - [j27]Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps. Eur. J. Oper. Res. 265(1): 290-302 (2018) - [j26]Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
Visualizing data as objects by DC (difference of convex) optimization. Math. Program. 169(1): 119-140 (2018) - 2017
- [j25]Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach. Comput. Oper. Res. 78: 369-380 (2017) - 2016
- [j24]Emilio Carrizosa, Amaya Nogales-Gómez, Dolores Romero Morales:
Strongly agree or strongly disagree?: Rating features in Support Vector Machines. Inf. Sci. 329: 256-273 (2016) - 2015
- [j23]Laureano F. Escudero, Juan Francisco Monge, Dolores Romero Morales:
An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management. Comput. Oper. Res. 58: 32-40 (2015) - 2014
- [j22]Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
A nested heuristic for parameter tuning in Support Vector Machines. Comput. Oper. Res. 43: 328-334 (2014) - [j21]Dolores Romero Morales, Richard Steinberg:
Revenue deficiency under second-price auctions in a supply-chain setting. Eur. J. Oper. Res. 233(1): 131-144 (2014) - [j20]Emilio Carrizosa, Amaya Nogales-Gómez, Dolores Romero Morales:
Heuristic approaches for support vector machines with the ramp loss. Optim. Lett. 8(3): 1125-1135 (2014) - 2013
- [j19]Emilio Carrizosa, Dolores Romero Morales:
Supervised classification and mathematical optimization. Comput. Oper. Res. 40(1): 150-165 (2013) - [j18]Laureano F. Escudero, Juan F. Monge, Dolores Romero Morales, Jingbo Wang:
Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management. Transp. Sci. 47(2): 181-197 (2013) - 2011
- [j17]Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
Detecting relevant variables and interactions in supervised classification. Eur. J. Oper. Res. 213(1): 260-269 (2011) - 2010
- [j16]Dolores Romero Morales, Jingbo Wang:
Forecasting cancellation rates for services booking revenue management using data mining. Eur. J. Oper. Res. 202(2): 554-562 (2010) - [j15]Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
Binarized Support Vector Machines. INFORMS J. Comput. 22(1): 154-167 (2010)
2000 – 2009
- 2009
- [j14]Dolores Romero Morales, Dries Vermeulen:
Existence of equilibria in a decentralized two-level supply chain. Eur. J. Oper. Res. 197(2): 642-658 (2009) - 2008
- [j13]Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
Multi-group support vector machines with measurement costs: A biobjective approach. Discret. Appl. Math. 156(6): 950-966 (2008) - 2007
- [j12]Emilio Carrizosa, Dolores Romero Morales:
A biobjective method for sample allocation in stratified sampling. Eur. J. Oper. Res. 177(2): 1074-1089 (2007) - [j11]Ravindra K. Ahuja, Wei Huang, H. Edwin Romeijn, Dolores Romero Morales:
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints. INFORMS J. Comput. 19(1): 14-26 (2007) - [j10]Emilio Carrizosa, Belen Martin-Barragan, Frank Plastria, Dolores Romero Morales:
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification. INFORMS J. Comput. 19(3): 470-479 (2007) - 2006
- [j9]Antonio Alonso-Ayuso, Laureano F. Escudero, Celeste Pizarro, H. Edwin Romeijn, Dolores Romero Morales:
On solving the multi-period single-sourcing problem under uncertainty. Comput. Manag. Sci. 3(1): 29-53 (2006) - 2005
- [j8]Stan P. M. van Hoesel, H. Edwin Romeijn, Dolores Romero Morales, Albert P. M. Wagelmans:
Integrated Lot Sizing in Serial Supply Chains with Production Capacities. Manag. Sci. 51(11): 1706-1719 (2005) - 2004
- [j7]H. Edwin Romeijn, Dolores Romero Morales:
Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case. J. Heuristics 10(1): 5-35 (2004) - [c1]Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales:
A Biobjective Model to Select Features with Good Classification Quality and Low Cost. ICDM 2004: 339-342 - 2003
- [j6]Richard Freling, H. Edwin Romeijn, Dolores Romero Morales, Albert P. M. Wagelmans:
A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem. Oper. Res. 51(6): 922-939 (2003) - 2001
- [j5]H. Edwin Romeijn, Dolores Romero Morales:
A probabilistic analysis of the multi-period single-sourcing problem. Discret. Appl. Math. 112(1-3): 301-328 (2001) - [j4]Emilio Carrizosa, Dolores Romero Morales:
Combining Minsum And Minmax: A Goal Programming Approach. Oper. Res. 49(1): 169-174 (2001) - [j3]H. Edwin Romeijn, Dolores Romero Morales:
Generating Experimental Data for the Generalized Assignment Problem. Oper. Res. 49(6): 866-878 (2001) - [j2]Emilio Carrizosa, Eduardo Conde, Antonia Castaño, Dolores Romero Morales:
Finding the principal points of a random variable. RAIRO Oper. Res. 35(3): 315-328 (2001) - 2000
- [j1]H. Edwin Romeijn, Dolores Romero Morales:
A class of greedy algorithms for the generalized assignment problem. Discret. Appl. Math. 103(1-3): 209-235 (2000)
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-10-07 21:21 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:
