Emilio Carrizosa

According to our database1, Emilio Carrizosa authored at least 98 papers between 1993 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
An interval branch and bound method for global Robust optimization.
J. Glob. Optim., 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

Analysis of an aggregate loss model in a Markov renewal regime.
Appl. Math. Comput., 2021

A cost-sensitive constrained Lasso.
Adv. Data Anal. Classif., 2021

2020
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality.
IEEE Syst. J., 2020

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

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

Embedding the production policy in location-allocation decisions.
4OR, 2020

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

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

Cost-sensitive Feature Selection for Support Vector Machines.
Comput. Oper. Res., 2019

On support vector machines under a multiple-cost scenario.
Adv. Data Anal. Classif., 2019

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 Building Online Visualization Maps for News Data Streams by Means of Mathematical Optimization.
Big Data, 2018

2017
A biobjective approach to recoverable robustness based on location planning.
Eur. J. Oper. Res., 2017

Solving multifacility Huff location models on networks using metaheuristic and exact approaches.
Comput. Oper. Res., 2017

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

2016
Minimizing the passengers' traveling time in the stop location problem.
J. Oper. Res. Soc., 2016

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

p-facility Huff location problem on networks.
Eur. J. Oper. Res., 2016

Robust newsvendor problem with autoregressive demand.
Comput. Oper. Res., 2016

A global optimization method for model selection in chemical reactions networks.
Comput. Chem. Eng., 2016

2015
Threshold robustness in discrete facility location problems: a bi-objective approach.
Optim. Lett., 2015

New heuristic for harmonic means clustering.
J. Glob. Optim., 2015

Kernel Penalized K-means: A feature selection method based on Kernel K-means.
Inf. Sci., 2015

A heuristic method for simultaneous tower and pattern-free field optimization on solar power systems.
Comput. Oper. Res., 2015

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

Biobjective sparse principal component analysis.
J. Multivar. Anal., 2014

Multi-instance classification through spherical separation and VNS.
Comput. Oper. Res., 2014

A local search heuristic for the (r|p)-centroid problem in the plane.
Comput. Oper. Res., 2014

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

A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions.
Comput. Oper. Res., 2014

rs-Sparse principal component analysis: A mixed integer nonlinear programming approach with VNS.
Comput. Oper. Res., 2014

Single-facility huff location problems on networks.
Ann. Oper. Res., 2014

Linear separation and approximation by minimizing the sum of concave functions of distances.
4OR, 2014

Vulnerability Assessment of Spatial Networks: Models and Solutions.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Time series interpolation via global optimization of moments fitting.
Eur. J. Oper. Res., 2013

Variable neighborhood search for minimum sum-of-squares clustering on networks.
Eur. J. Oper. Res., 2013

Locating a semi-obnoxious covering facility with repelling polygonal regions.
Discret. Appl. Math., 2013

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

Solving the median problem with continuous demand on a network.
Comput. Optim. Appl., 2013

The Stop Location Problem with Realistic Traveling Time.
Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

2012
Minmax-distance approximation and separation problems: geometrical properties.
Math. Program., 2012

A Note on the Dependence Structure of the Two-State Markovian Arrival Process.
J. Appl. Probab., 2012

On approximate Monetary Unit Sampling.
Eur. J. Oper. Res., 2012

Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics.
Electron. Notes Discret. Math., 2012

VNS heuristic for the (r|p)-centroid problem on the plane.
Electron. Notes Discret. Math., 2012

A computational study of a nonlinear minsum facility location problem.
Comput. Oper. Res., 2012

Gaussian variable neighborhood search for continuous optimization.
Comput. Oper. Res., 2012

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

A global optimization procedure for the location of a median line in the three-dimensional space.
Eur. J. Oper. Res., 2011

Locating a competitive facility in the plane with a robustness criterion.
Eur. J. Oper. Res., 2011

On minimax-regret Huff location models.
Comput. Oper. Res., 2011

A new alternating heuristic for the (r | p)-centroid problem on the plane.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
On the norm of a dc function.
J. Glob. Optim., 2010

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

Unequal probability sampling from a finite population: A multicriteria approach.
Eur. J. Oper. Res., 2010

Alternating local search based VNS for linear classification.
Ann. Oper. Res., 2010

2009
Locating Objects in the Plane Using Global Optimization Techniques.
Math. Oper. Res., 2009

Continuous location problems and Big Triangle Small Triangle: constructing better bounds.
J. Glob. Optim., 2009

2008
Optimal Expected-Distance Separating Halfspace.
Math. Oper. Res., 2008

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

Dimensionality Reduction for Classification.
Proceedings of the Advanced Data Mining and Applications, 4th International Conference, 2008

2007
An exact global optimization method for deriving weights from pairwise comparison matrices.
J. Glob. Optim., 2007

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

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

2006
Inferring Efficient Weights from Pairwise Comparison Matrices.
Math. Methods Oper. Res., 2006

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

2004
Optimal location and design of a competitive facility.
Math. Program., 2004

Improving Interval Analysis Bounds by Translations.
J. Glob. Optim., 2004

An Exact Method for Fractional Goal Programming.
J. Glob. Optim., 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
Robust facility location.
Math. Methods Oper. Res., 2003

2002
Generalized Goal Programming: polynomial methods and applications.
Math. Program., 2002

A D.C. biobjective location model.
J. Glob. Optim., 2002

A fractional model for locating semi-desirable facilities on networks.
Eur. J. Oper. Res., 2002

Optimal Positioning of a Mobile Service Unit on a Line.
Ann. Oper. Res., 2002

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

An optimal bound for d.c. programs with convex constraints.
Math. Methods Oper. Res., 2001

Finding GM-estimators with global optimization techniques.
J. Glob. Optim., 2001

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

2000
Dominators for Multiple-objective Quasiconvex Maximization Problems.
J. Glob. Optim., 2000

Solving Nonconvex Planar Location Problems by Finite Dominating Sets.
J. Glob. Optim., 2000

On Covering Methods for D.C. Optimization.
J. Glob. Optim., 2000

1999
Undesirable facility location with minimal covering objectives.
Eur. J. Oper. Res., 1999

1998
Location and shape of a rectangular facility in Real<sup>n</sup> Convexity properties.
Math. Program., 1998

Locating an Undesirable Facility by Generalized Cutting Planes.
Math. Oper. Res., 1998

A Note on the Optimal Positioning of Service Units.
Oper. Res., 1998

1997
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case.
Math. Oper. Res., 1997

Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case.
Math. Oper. Res., 1997

1996
A characterization of efficient points in constrained location problems with regional demand.
Oper. Res. Lett., 1996

1995
On minquantile and maxcovering optimisation.
Math. Program., 1995

Planar point-objective location problems with nonconvex constraints: A geometrical construction.
J. Glob. Optim., 1995

1993
Efficiency in Euclidean constrained location problems.
Oper. Res. Lett., 1993


  Loading...