Maximum-flow network problem
Reference work entry
- 17 Downloads
For a directed, capacitated network with source and sink nodes, the problem is to find the maximum amount of goods (flow) that can be sent from the source to the sink.
© Kluwer Academic Publishers 2001