首页 正文

Minimum flow decomposition in graphs with cycles using integer linear programming

{{output}}
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 Science, and variants of it are powerful models in a different fields such as Bioinfo... ...