maximum flow problem


maximum flow problem

[¦mak·sə·məm ′flō ‚präb·ləm] (mathematics) The problem of finding a feasible flow in an s-t network with the largest possible flow value for a given weight function.