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…