# Changes in doc/min_cost_flow.dox[956:141f9c0db4a3:1270:dceba191c00d] in lemon

Ignore:
File:
1 edited

### Legend:

Unmodified
 r956 * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2010 * Copyright (C) 2003-2013 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). minimum total cost from a set of supply nodes to a set of demand nodes in a network with capacity constraints (lower and upper bounds) and arc costs \ref amo93networkflows. and arc costs \cite amo93networkflows. Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$, \f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A \f] However if the sum of the supply values is zero, then these two problems However, if the sum of the supply values is zero, then these two problems are equivalent. The \ref min_cost_flow_algs "algorithms" in LEMON support the general