Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Labbé, Martine"'
Autor:
Bustamante-Faúndez, Pamela, L., Víctor Bucarey, Labbé, Martine, Marianov, Vladimir, Ordóñez, Fernando
Anticipating the strategies of potential attackers is crucial for protecting critical infrastructure. We can represent the challenge of the defenders of such infrastructure as a Stackelberg security game. The defender must decide how to allocate limi
Externí odkaz:
http://arxiv.org/abs/2405.09356
In this paper, we extend the notions of $\lambda$-cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network whi
Externí odkaz:
http://arxiv.org/abs/2401.12673
In this paper we address two different related problems. We first study the problem of finding a simple shortest path in a $d$-dimensional real space subdivided in several polyhedra endowed with different $\ell_p$-norms. This problem is a variant of
Externí odkaz:
http://arxiv.org/abs/2110.07866
This paper proposes a polynomial-time algorithm to construct the monotone stepwise curve that minimizes the sum of squared errors with respect to a given cloud of data points. The fitted curve is also constrained on the maximum number of steps it can
Externí odkaz:
http://arxiv.org/abs/2012.03697
Autor:
Almeftah, Tifaout, Brotcorne, Luce, Cattaruzza, Diego, Fortz, Bernard, Keita, Kaba, Labbé, Martine, Ogier, Maxime, Semet, Frédéric
Group testing is a screening strategy that involves dividing a population into several disjointed groups of subjects. In its simplest implementation, each group is tested with a single test in the first phase, while in the second phase only subjects
Externí odkaz:
http://arxiv.org/abs/2011.06927
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length
Externí odkaz:
http://arxiv.org/abs/2007.06647
This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by including a bud
Externí odkaz:
http://arxiv.org/abs/1808.02435
The Discrete Ordered Median Problem (DOMP) is formulated as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting po
Externí odkaz:
http://arxiv.org/abs/1802.03191