Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem

by James B. Orlin

No reviews yet
First published: 1984 1 language

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!


More by James B. Orlin


You Might Also Like

More in Network analysis
Advances in Computers

Advances in Computers

Marshall C. Yovits
[Papers presented at the 20th Annual Conference of the Ontario Educational Research Council, Toronto, Ontario, December 1-2, 1978]

[Papers presented at the 20th Annual Con...

Ontario Educational Research Council. Conference