A simplex algorithm for minimum-cost network-flow problems in infinite networks

Thomas C. Sharkey, H. Edwin Romeijn. A simplex algorithm for minimum-cost network-flow problems in infinite networks. Networks, 52(1):14-31, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.