Abstract
Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called network flow problems. They form the most important special class of linear programming problems.
Cite
CITATION STYLE
APA
Network flow problems. (2014). In International Series in Operations Research and Management Science (Vol. 196, pp. 199–224). Springer New York LLC. https://doi.org/10.1007/978-1-4614-7630-6_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free