[HTML][HTML] A mathematical programming approach to SVM-based classification with label noise
In this paper we propose novel methodologies to optimally construct Support Vector
Machine-based classifiers that take into account that label noise occur in the training …
Machine-based classifiers that take into account that label noise occur in the training …
[HTML][HTML] Fairness in maximal covering location problems
This paper provides a mathematical optimization framework to incorporate fairness
measures from the facilities' perspective to discrete and continuous maximal covering …
measures from the facilities' perspective to discrete and continuous maximal covering …
[HTML][HTML] Multi-type maximal covering location problems: Hybridizing discrete and continuous problems
This paper introduces a general modeling framework for a multi-type maximal covering
location problem in which the position of facilities in different normed spaces are …
location problem in which the position of facilities in different normed spaces are …
[HTML][HTML] The soft-margin Support Vector Machine with ordered weighted average
This paper deals with a cost sensitive extension of the standard Support Vector Machine
(SVM) using an ordered weighted sum of the deviations of misclassified individuals with …
(SVM) using an ordered weighted sum of the deviations of misclassified individuals with …
[HTML][HTML] A multiple-drone arc routing and mothership coordination problem
This paper considers the optimisation problems that arise in coordinating a tandem between
a mothership vehicle and a fleet of drones. Each drone can be launched from the …
a mothership vehicle and a fleet of drones. Each drone can be launched from the …
Optimal arrangements of hyperplanes for SVM-based multiclass classification
In this paper, we present a novel SVM-based approach to construct multiclass classifiers by
means of arrangements of hyperplanes. We propose different mixed integer (linear and non …
means of arrangements of hyperplanes. We propose different mixed integer (linear and non …
On lp-support vector machines and multidimensional kernels
In this paper, we extend the methodology developed for Support Vector Machines (SVM)
using the l 2-norm (l 2-SVM) to the more general case of lp-norms with p> 1 (lp-SVM). We …
using the l 2-norm (l 2-SVM) to the more general case of lp-norms with p> 1 (lp-SVM). We …
Continuous maximal covering location problems with interconnected facilities
In this paper we analyze a continuous version of the maximal covering location problem, in
which the facilities are required to be linked by means of a given graph structure (provided …
which the facilities are required to be linked by means of a given graph structure (provided …
When closest is not always the best: The distributed p-median problem
J Brimberg, A Maier, A Schöbel - Journal of the Operational …, 2021 - Taylor & Francis
The classical p-median problem assumes that service to customers is always provided by
the closest facility, while in practice, customers often interact for a variety of reasons with …
the closest facility, while in practice, customers often interact for a variety of reasons with …
[HTML][HTML] Reviewing extensions and solution methods of the planar Weber single facility location problem
One of the classic foundational constructs of Location Science was proposed by Alfred
Weber in 1909. His construct involved finding the location for a single production facility …
Weber in 1909. His construct involved finding the location for a single production facility …