Network flows - Search Results - UAB Digital Repository of Documents

Search collections:

Sort by:	Display results:	Output format:

Results overview: Found 2 records in 0.02 seconds.
Articles, 2 records found

Articles	2 records found

16 p, 999.8 KB

How to compute least infeasible flows / McCormick, S. Thomas
It is well-known how to use maximum flow to decide when a flow problem with demands, lower bounds, and upper bounds is infeasible. Less well-known is how to compute a flow that is least infeasible. This paper considers many possible ways to define "least infeasible" and shows how to compute optimal flows for each definition. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 179-194

UAB restricted access

Detailed record -

21 p, 1.1 MB

A polynomial time primal network simplex algorithm for minimum cost flows / Orlin, James B.
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and (infin) otherwise. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 109-129

UAB restricted access

Detailed record -

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.