Dolores Romero Morales

Jasone Ramírez-Ayerbe

Expert Syst. Appl., March, 2024

2023

On clustering and interpreting with rules by means of mathematical optimization.

[BibT_eX]

[DOI]

Kseniia Kurishchenko

Alfredo Marín

Comput. Oper. Res., June, 2023

On mathematical optimization for clustering categories in contingency tables.

[BibT_eX]

[DOI]

Adv. Data Anal. Classif., June, 2023

On optimal regression trees to detect critical intervals for multivariate functional data.

[BibT_eX]

[DOI]

Comput. Oper. Res., April, 2023

2022

The tree based linear regression model for hierarchical categorical variables.

[BibT_eX]

[DOI]

Laust Hvas Mortensen

M. Remedios Sillero-Denamiel

Expert Syst. Appl., 2022

On sparse optimal regression trees.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Supervised Feature Compression based on Counterfactual Analysis.

[BibT_eX]

[DOI]

Veronica Piccialli

Cecilia Salvatore

CoRR, 2022

2021

On clustering categories of categorical predictors in generalized linear models.

[BibT_eX]

[DOI]

Marcela Galvis Restrepo

Expert Syst. Appl., 2021

On sparse ensemble methods: An application to short-term predictions of the evolution of COVID-19.

[BibT_eX]

[DOI]

Sandra Benítez-Peña

María-Dolores Jiménez-Gamero

Belén Martín-Barragán

Pepa Ramírez-Cobo

M. Remedios Sillero-Denamiel

Eur. J. Oper. Res., 2021

Optimal randomized classification trees.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2020

Sparsity in optimal randomized classification trees.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

2018

Visualizing data as objects by DC (difference of convex) optimization.

[BibT_eX]

[DOI]

Math. Program., 2018

On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty.

[BibT_eX]

[DOI]

Laureano F. Escudero

Juan Francisco Monge

Comput. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Daniel Hardt

Big Data, 2018

2017

Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

2016

Strongly agree or strongly disagree?: Rating features in Support Vector Machines.

[BibT_eX]

[DOI]

Amaya Nogales-Gómez

Inf. Sci., 2016

2015

An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management.

[BibT_eX]

[DOI]

Laureano F. Escudero

Juan Francisco Monge

Comput. Oper. Res., 2015

2014

Heuristic approaches for support vector machines with the ramp loss.

[BibT_eX]

[DOI]

Amaya Nogales-Gómez

Optim. Lett., 2014

Revenue deficiency under second-price auctions in a supply-chain setting.

[BibT_eX]

[DOI]

Richard Steinberg

Eur. J. Oper. Res., 2014

A nested heuristic for parameter tuning in Support Vector Machines.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

2013

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

[BibT_eX]

[DOI]

Laureano F. Escudero

Juan F. Monge

Jingbo Wang

Transp. Sci., 2013

Supervised classification and mathematical optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

2011

Detecting relevant variables and interactions in supervised classification.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

2010

Binarized Support Vector Machines.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

Forecasting cancellation rates for services booking revenue management using data mining.

[BibT_eX]

[DOI]

Jingbo Wang

Eur. J. Oper. Res., 2010

2009

Existence of equilibria in a decentralized two-level supply chain.

[BibT_eX]

[DOI]

Dries Vermeulen

Eur. J. Oper. Res., 2009

2008

Multi-group support vector machines with measurement costs: A biobjective approach.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification.

[BibT_eX]

[DOI]

Frank Plastria

INFORMS J. Comput., 2007

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.

[BibT_eX]

[DOI]

Ravindra K. Ahuja

Wei Huang

INFORMS J. Comput., 2007

A biobjective method for sample allocation in stratified sampling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

On solving the multi-period single-sourcing problem under uncertainty.

[BibT_eX]

[DOI]

Comput. Manag. Sci., 2006

2005

Integrated Lot Sizing in Serial Supply Chains with Production Capacities.

[BibT_eX]

[DOI]

Stan P. M. van Hoesel

Albert P. M. Wagelmans

Manag. Sci., 2005

2004

Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case.

[BibT_eX]

[DOI]

J. Heuristics, 2004

A Biobjective Model to Select Features with Good Classification Quality and Low Cost.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Richard Freling

Albert P. M. Wagelmans

Oper. Res., 2003

2001

Finding the principal points of a random variable.

[BibT_eX]

[DOI]

Eduardo Conde

Antonia Castaño

RAIRO Oper. Res., 2001

Generating Experimental Data for the Generalized Assignment Problem.

[BibT_eX]

[DOI]

Oper. Res., 2001

Combining Minsum And Minmax: A Goal Programming Approach.

[BibT_eX]

[DOI]

Oper. Res., 2001

A probabilistic analysis of the multi-period single-sourcing problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

A class of greedy algorithms for the generalized assignment problem.

[BibT_eX]

[DOI]