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…