22 citations
- École Nationale Supérieure de Techniques AvancéesFR9 papers
- Centre d'études et de recherche en informatique et communicationsFR6 papers
- CERMICSFR3 papers
- Universidade de BrasíliaBR2 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR1 paper
- École PolytechniqueFR1 paper
- Électricité de France (France)FR1 paper
- Institut de recherche mathématique de RennesFR1 paper
- Institute for Sustainable DevelopmentET1 paper
- Instituto de Geofísica y AstronomíaCU1 paper
- Kyushu UniversityJP1 paper
- Laboratoire de Mathématiques Blaise PascalFR1 paper
24 papers
The -norm of the forward stochastic integral w.r.t. Fractional Brownian motion
Alberto Ohashi, Francesco Russo
In this article, we present the exact expression of the -norm of the forward stochastic integral driven by the multi-dimensional fractional Brownian motion with parameter $\fr…
The isometry of symmetric-Stratonovich integrals w.r.t. Fractional Brownian motion
Alberto Ohashi, Francesco Russo, Frederi Viens
In this work, we present a detailed analysis on the exact expression of the -norm of the symmetric-Stratonovich stochastic integral driven by a multi-dimensional fractional Br…
Compact MILP formulations for the -center problem
Zacharie Ales, Sourour Elloumi
The p-center problem consists in selecting p centers among M to cover N clients, such that the maximal distance between a client and its closest selected center is minimized. For t…
Achievement and Fragility of Long-term Equitability
Andrea Simonetto, Ivano Notarnicola
Equipping current decision-making tools with notions of fairness, equitability, or other ethically motivated outcomes, is one of the top priorities in recent research efforts in ma…
An efficient Benders decomposition for the p-median problem
Cristian Durán Mateluna, Zacharie Alès, Sourour Elloumi
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its neare…
A Quantum Algorithm for the Sub-Graph Isomorphism Problem
Nicola Mariella, Andrea Simonetto
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency…