6 citations · 11 across the 7 of their papers we have counts for
7 papers
Accelerating ILP solvers for Minimum Flow Decompositions through search space and dimensionality reductions
Andreas Grigorjew, Fernando H. C. Dias, Andrea Cracco +2
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, st…
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming
Fernando H. C. Dias, Manuel Caceres, Lucia Williams +2
Many important problems in Bioinformatics (e.g., assembly or multi-assembly) admit multiple solutions, while the final objective is to report only one. A common approach to deal wi…
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
Minimum flow decomposition (MFD) -- the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow -- is a classical problem in Computer Sci…
Aircraft Conflict Resolution with Trajectory Recovery Using Mixed-Integer Programming
Fernando H. C. Dias, David Rey
To guarantee the safety of flight operations, decision-support systems for air traffic control must be able to improve the usage of airspace capacity and handle increasing demand.…
Fast, Flexible, and Exact Minimum Flow Decompositions via ILP
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
Minimum flow decomposition (MFD) (the problem of finding a minimum set of paths that perfectly decomposes a flow) is a classical problem in Computer Science, and variants of it are…
Robust aircraft conflict resolution under trajectory prediction uncertainty
Fernando H C Dias, David Rey
We address the aircraft conflict resolution problem under trajectory prediction uncertainty. We consider that aircraft velocity vectors may be perturbed due to weather effects, suc…