Minimum cost flow problem
The minimum-cost flow problem or min-cost-flow problem represents a general framework for distribution, transport and flow problems. In general, an attempt is made to transport a quantity of a good from provider nodes, possibly via transfer locations, to the demand nodes and that at the lowest possible cost. Known problems in this category are the reloading problem or the transport problem . If the question is asked about the maximum amount of goods that can be transported from all providers (sources) to all consumers (sinks), one speaks of maximum flow problems or max flow problems .
literature
- Oliver Zlotowski: Design, implementation and evaluation of network data structures and network algorithms to solve the minimum cost flow problem . Logos Berlin (September 20, 2010). ISBN 978-3832526009
Individual evidence
- ↑ Leena Suhl, Taieb Mellouli: Optimization systems: models, processes, software, applications . Jumper; Edition: 2nd, revised. 2009 edition (June 10, 2009). ISBN 978-3642015793 . Page 169