Supervised classification and mathematical optimization

E Carrizosa, DR Morales - Computers & Operations Research, 2013 - Elsevier
Data mining techniques often ask for the resolution of optimization problems. Supervised
classification, and, in particular, support vector machines, can be seen as a paradigmatic …

[HTML][HTML] Mathematical optimization modelling for group counterfactual explanations

E Carrizosa, J Ramírez-Ayerbe, DR Morales - European Journal of …, 2024 - Elsevier
Counterfactual Analysis has shown to be a powerful tool in the burgeoning field of
Explainable Artificial Intelligence. In Supervised Classification, this means associating with …

Continuous location of dimensional structures

JM Dıaz-Bánez, JA Mesa, A Schöbel - European Journal of Operational …, 2004 - Elsevier
A natural extension of point facility location problems are those problems in which facilities
are extensive, ie those that cannot be represented by isolated points but as some …

Robust facility location

E Carrizosa, S Nickel - Mathematical methods of operations research, 2003 - Springer
Let A be a nonempty finite subset of the plane representing the geographical coordinates of
a set of demand points (towns,…), to be served by a facility, whose location within a given …

Tightening big Ms in integer programming formulations for support vector machines with ramp loss

M Baldomero-Naranjo, LI Martínez-Merino… - European Journal of …, 2020 - Elsevier
This paper considers various models of support vector machines with ramp loss, these being
an efficient and robust tool in supervised classification for the detection of outliers. The exact …

Evading classifiers in discrete domains with provable optimality guarantees

B Kulynych, J Hayes, N Samarin… - arXiv preprint arXiv …, 2018 - arxiv.org
Machine-learning models for security-critical applications such as bot, malware, or spam
detection, operate in constrained discrete domains. These applications would benefit from …

On the multisource hyperplanes location problem to fitting set of points

V Blanco, A Japón, D Ponce, J Puerto - Computers & Operations Research, 2021 - Elsevier
In this paper we study the problem of locating a given number of hyperplanes minimizing an
objective function of the closest distances from a set of points. We propose a general …

Solving scheduling and location problems in the plane simultaneously

MT Kalsch, Z Drezner - Computers & operations research, 2010 - Elsevier
In this paper we concentrate on the simultaneous single machine scheduling–location
(ScheLoc) model in the plane. The model combines both the location of the machine and the …

Minkowski Geometry—Some Concepts and Recent Developments

V Balestro, H Martini - Surveys in Geometry I, 2022 - Springer
The geometry of finite-dimensional normed spaces (= Minkowski geometry) is a research
topic which is related to many other fields, such as convex geometry, discrete and …

Coproximinality of linear subspaces in generalized Minkowski spaces

T Jahn, C Richter - Journal of Mathematical Analysis and Applications, 2021 - Elsevier
We show that, for vector spaces in which distance measurement is performed using a
gauge, the existence of best coapproximations in 1-codimensional closed linear subspaces …