Research Reports from the Department of Operations
Document Type
Dissertation
Publication Date
5-25-1973
Abstract
Simple, yet powerful non-simplex algorithms are developed for max flow and min-cost flow problems in networks with positive gains. It is shown that these algorithms are computationally better than existing non-simplex algorithms. A strong relationship between the min-cost flow problem in pure networks and the max flow problem in networks with positive gains is used to demonstrate how algorithms for one problem can be transformed into ones for the other problem.
Keywords
Operations research, Algorithms, Mathematical optimization, Mathematical models
Publication Title
Dissertation/Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 302 ; Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy.
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Truemper, Klaus, "Optimal Flows in Networks with Positive Gains" (1973). Research Reports from the Department of Operations. 388.
https://commons.case.edu/wsom-ops-reports/388