6 citations · 11 across the 7 of their papers we have counts for
Showing q-bio.GNShow all
2 papers · 1 filter
q-bio.GN2023
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…
q-bio.GN2022★ 6 cited
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…