1 citations · 1 across the 3 of their papers we have counts for
4 papers
Fused ultrametric Gromov-Wasserstein for Scenario Tree generation in Multistage Stochastic Programming
Antonio Candelieri, Iman Seyedi, Francesco Archetti
Multistage Stochastic Programming requires scenario trees that accurately approximate the unknown underlying uncertainty process without violating the non-anticipativity constraint…
Diffusion enabled Optimal Transport distances for graph matching
Iman Seyedi, Francesco Archetti
This paper introduces Diffusion Semi-Relaxed Fused Gromov-Wasserstein (DsrFGW), a novel method for graph comparison that unifies node features and structural connectivity through o…
Structural Vulnerability Assessment in Urban Transport Networks: A Network-Wide Geometric Approach Using Gromov-Wasserstein
Iman Seyedi, Antonio Candelieri, Enza Messina +1
Urban transportation networks are inherently vulnerable to disruptions that affect connectivity and passenger mobility. Traditional graph_theoretic metrics, such as betweenness and…
Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
Iman Seyedi, Antonio Candelieri, Enza Messina +1
The assignment problem, a cornerstone of operations research, seeks an optimal one-to-one mapping between agents and tasks to minimize total cost. This work traces its evolution fr…