5 papers
An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem
Tomás Lagos, Dmytro Matsypura
We study a class of mixed-integer bilevel stochastic programs where the leader commits to a first-stage decision before uncertainty is realized, and the follower solves a subsequen…
Designing Efficient and Reachable Routes: The -Step-Central Shortest Path Problem
Johnson Phosavanh, Dmytro Matsypura
Designing rapid transportation routes requires balancing efficiency and reachability. Shortest-path models ensure direct, cost-efficient routes but ignore coverage, while centralit…
Learning Shortest Paths When Data is Scarce
Dmytro Matsypura, Yu Pan, Hanzhao Wang
Digital twins and other simulators are increasingly used to support routing decisions in large-scale networks. However, simulator outputs often exhibit systematic bias, while groun…
Centrality of shortest paths: Algorithms and complexity results
Johnson Phosavanh, Dmytro Matsypura
The degree centrality of a node, defined as the number of nodes adjacent to it, is often used as a measure of importance of a node to the structure of a network. This metric can be…
Graph Pseudotime Analysis and Neural Stochastic Differential Equations for Analyzing Retinal Degeneration Dynamics and Beyond
Dai Shi, Kuan Yan, Lequan Lin +6
Understanding disease progression at the molecular pathway level usually requires capturing both structural dependencies between pathways and the temporal dynamics of disease evolu…