Mathematical optimization modelling for group counterfactual explanations |
|
On clustering and interpreting with rules by means of mathematical optimization |
|
Generating collective counterfactual explanations in score-based classification via mathematical optimization |
|
Cost-sensitive probabilistic predictions for support vector machines |
|
A new model for counterfactual analysis for functional data |
|
Solving the 1-median problem on a network with continuous demand and demand surplus |
|
On optimal regression trees to detect critical intervals for multivariate functional data |
|
On mathematical optimization for clustering categories in contingency tables |
|
The tree based linear regression model for hierarchical categorical variables |
|
Optimal randomized classification trees |
|
Analysis of an aggregate loss model in a Markov renewal regime |
|
On Sparse Optimal Regression Trees |
|
On clustering categories of categorical predictors in generalized linear models |
|
Variable selection for Naïve Bayes classification |
|
An interval branch and bound method for global Robust optimization |
|
Constrained Naïve Bayes with application to unbalanced data classification |
|
On sparse ensemble methods: An application to short-term predictions of the evolution of COVID-19 |
|
An extremal problem with applications to renewable energy production |
|
Interpreting Clusters via Prototype Optimization |
|
Carrera unified formulation (CUF) for the micropolar beams: Analytical solutions |
|
Mathematical optimization in classification and regression trees |
|
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality |
|
Sparsity in optimal randomized classification trees |
|
Integer constraints for enhancing interpretability in linear regression |
|
Selection of time instants and intervals with Support Vector Regression for multivariate functional data |
|
A cost-sensitive constrained Lasso |
|
Continuous optimisation techniques for optimal aiming strategies in solar power tower plants |
|
On support vector machines under a multiple-cost scenario |
|
Visualization of complex dynamic datasets by means of mathematical optimization |
|
Cost-sensitive Feature Selection for Support Vector Machines |
|
Functional-bandwidth kernel for Support Vector Machine with Functional Data: An alternating optimization algorithm |
|
Variable selection in classification for multivariate functional data |
|
Heliostat field cleaning scheduling for Solar Power Tower plants: A heuristic approach |
|
Editorial |
|
Enhancing Interpretability in Factor Analysis by Means of Mathematical Optimization |
|
Embedding the production policy in location-allocation decisions |
|
On Building Online Visualization Maps for News Data Streams by Means of Mathematical Optimization |
|
Visualizing data as objects by DC (difference of convex) optimization |
|
On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps |
|
An optimization tool to design the field of a solar power tower plant allowing heliostats of different sizes |
|
Optimisation of aiming strategies in Solar Power Tower plants |
|
A biobjective approach to recoverable robustness based on location planning |
|
A sparsity-controlled vector autoregressive model |
|
Visualizing proportions and dissimilarities by Space-filling maps: A Large Neighborhood Search approach |
|
Clustering categories in support vector machines |
|
Editorial |
|
P-facility Huff location problem on networks |
|
On Extreme Concentrations in Chemical Reaction Networks with Incomplete Measurements |
|
Editorial |
|
A global optimization method for model selection in chemical reactions networks |
|
Maximal Covering Location Problems on networks with regional demand |
|
Minimizing the passengers' traveling time in the stop location problem |
|
Robust newsvendor problem with autoregressive demand |
|
Strongly agree or strongly disagree?: Rating features in Support Vector Machines |
|
Kernel Penalized K-means: A feature selection method based on Kernel K-means |
|
New heuristic for harmonic means clustering |
|
Threshold robustness in discrete facility location problems: a bi-objective approach |
|
Comments on: Static and dynamic source locations in undirected networks 1 |
|
Optimization of multiple receivers solar power tower systems |
|
A heuristic method for simultaneous tower and pattern-free field optimization on solar power systems |
|
rs-Sparse principal component analysis: A mixed integer nonlinear programming approach with VNS |
|
A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions |
|
Multi-instance classification through spherical separation and VNS |
|
A local search heuristic for the (r vertical bar p)-centroid problem in the plane |
|
Single-facility huff location problems on networks |
|
Biobjective sparse principal component analysis |
|
The Markovian arrival process: A statistical model for daily precipitation amounts |
|
Heuristic approaches for support vector machines with the ramp loss |
|
Linear separation and approximation by minimizing the sum of concave functions of distances |
|
A nested heuristic for parameter tuning in Support Vector Machines |
|
Solving the median problem with continuous demand on a network |
|
Locating a semi-obnoxious covering facility with repelling polygonal regions |
|
Variable neighborhood search for minimum sum-of-squares clustering on networks |
|
Time series interpolation via global optimization of moments fitting |
|
Supervised classification and mathematical optimization |
|
Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics |
|
VNS heuristic for the (r|p)-centroid problem on the plane |
|
A computational study of a nonlinear minsum facility location problem |
|
Gaussian variable neighborhood search for continuous optimization |
|
Minmax-distance approximation and separation problems: geometrical properties |
|
A NOTE ON THE DEPENDENCE STRUCTURE OF THE TWO-STATE MARKOVIAN ARRIVAL PROCESS |
|
On approximate Monetary Unit Sampling |
|
Maximizing upgrading and downgrading margins for ordinal regression |
|
Sum-of-squares clustering on networks |
|
A global optimization procedure for the location of a median line in the three-dimensional space |
|
Locating a competitive facility in the plane with a robustness criterion |
|
Detecting relevant variables and interactions in supervised classification |
|
Binarized Support Vector Machines |
|
On the norm of a dc function |
|
Unequal probability sampling from a finite population: A multicriteria approach |
|
Alternating local search based VNS for linear classification |
|
Locating Objects in the Plane Using Global Optimization Techniques |
|
Continuous location problems and Big Triangle Small Triangle: constructing better bounds |
|
Different numerical methods in the study of passive scalar transport in a pipeline x-junction |
|
Optimal expected-distance separating halfspace |
|
Multi-group support vector machines with measurement costs: A biobjective approach |
|
On the selection of the globally optimal prototype subset for nearest-neighbor classification |
|
A biobjective method for sample allocation in stratified sampling |
|
Deriving weights in multiple-criteria decision making with support vector machines |
|
Inferring efficient weights from pairwise comparison matrices |
|
Two-group classification via a biobjective margin maximization model |
|
Improving interval analysis bounds by translations |
|
Optimal location and design of a competitive facility |
|
An exact method for fractional goal programming |
|
Robust facility location |
|
Generalized Goal Programming: polynomial methods and applications |
|
A DC biobjective location model |
|
Optimal positioning of a mobile service unit on a line |
|
A fractional model for locating semi-desirable facilities on networks |
|
An optimal bound for d.c. programs with convex constraints |
|
Gauge distances and median hyperplanes |
|
Finding the principal points of a random variable |
|
Combining minsum and minmax: A goal programming approach |
|
On covering methods for d.c. optimization |
|
Optimization of the norm of a vector-valued DC function and applications |
|
Solving nonconvex planar location problems by finite dominating sets |
|
Dominators for multiple-objective quasiconvex maximization problems |
|
Undesirable facility location with minimal covering objectives |
|
Utility of SPECT in Alzheimer's disease,Utilidad del SPECT en el estudio de la enfermedad de Alzheimer |
|
Utility of SPECT in Alzheimer's disease |
|
Location and shape of a rectangular facility in R-n. Convexity properties |
|
Locating an undesirable facility by generalized cutting planes |
|
Admission policies in loss queueing models with heterogeneous arrivals |
|
Dominating sets for convex functions with some applications |
|
A note on the optimal positioning of service units |
|
Semi-obnoxious location models: A global optimization approach |
|
Simpson points in planar problems with locational constraints. The polyhedral-gauge case |
|
Simpson points in planar problems with locational constraints. The round-norm case |
|
Weber problems with alternative transportation systems |
|
A characterization of efficient points in constrained location problems with regional demand |
|
A characterization of halfspace depth |
|
Geometrical characterization of weakly efficient points |
|
THE GENERALIZED WEBER PROBLEM WITH EXPECTED DISTANCES |
|
On minquantile and maxcovering optimisation |
|
THE DETERMINATION OF A LEAST QUANTILE OF SQUARES REGRESSION LINE FOR ALL QUANTILES |
|
MULTICRITERIA ANALYSIS WITH PARTIAL INFORMATION ABOUT THE WEIGHTING COEFFICIENTS |
|
PARETO-OPTIMALITY IN LINEAR-REGRESSION |
|
A DISCRETIZING ALGORITHM FOR LOCATION-PROBLEMS |
|
PLANAR POINT-OBJECTIVE LOCATION-PROBLEMS WITH NONCONVEX CONSTRAINTS - A GEOMETRICAL CONSTRUCTION |
|
An axiomatic approach to the cent-dian criterion |
|
A Polygonal Upper Bound for the Efficient Set for Single Location Problems with Mixed Norms |
|
EFFICIENCY IN EUCLIDEAN CONSTRAINED LOCATION-PROBLEMS |
|
El conjunto eficiente en problemas de localización con normas mixtas (Lp) |
|