{"version":"1.0","type":"link","title":"Submodular flow - Newikis","description":"In the theory of combinatorial optimization, submodular flow is a general class of optimization problems that includes as special cases the minimum-cost flow problem, matroid intersection, and the problem of computing a minimum-weight dijoin in a weighted directed graph. It was originally…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}