Abstract
In the following we analyse the network flow problem from different points of view, thereby we develop the most common approaches resp. algorithms for solving min-cost-flow and circulation problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Derigs, U. (1988). Approaches to Min-Cost Flow Problems. In: Programming in Networks and Graphs. Lecture Notes in Economics and Mathematical Systems, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51713-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-51713-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18969-5
Online ISBN: 978-3-642-51713-6
eBook Packages: Springer Book Archive