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

Additional Metadata
Publisher	CWI
Series	Department of Operations Research and System Theory [BS]
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Orlin, J. B. (1985). Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem. In Department of Operations Research and System Theory [BS] (R 8504). CWI.

Publication