{"id":"https://openalex.org/keywords/minimum-cost-maximum-flow","display_name":"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.","display_name_alternatives":["minimum cost maximal flow","minimum-cost maximum-flow problem","MCMF"],"ids":{"openalex":"https://openalex.org/keywords/minimum-cost-maximum-flow","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":291,"cited_by_count":3102,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/minimum-cost-maximum-flow","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
