Keyword

minimum cost maximum flow

Description: A network optimization problem that finds the greatest feasible flow from a source to a sink at the lowest total edge cost.
OpenAlex ID: keywords/minimum-cost-maximum-flow
Works count: 291
Citation count: 3,102
Year
Topic
Type