| dc.contributor.author | Orlin, James B. | en_US |
| dc.contributor.other | Sloan School of Management. | en_US |
| dc.date.accessioned | 2009-10-01T22:07:16Z | |
| dc.date.available | 2009-10-01T22:07:16Z | |
| dc.date.issued | 1984] | en_US |
| dc.identifier | genuinelypolynom00orli | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/48015 | |
| dc.description | "December 1984." | en_US |
| dc.publisher | Cambridge, Mass. : Massachusetts Institute of Technology | en_US |
| dc.relation.ispartofseries | Working paper (Sloan School of Management) ; 1615-84. | en_US |
| dc.subject | Network analysis. | en_US |
| dc.subject | Algorithms. | en_US |
| dc.title | Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem | en_US |
| dc.type | Working Paper | en_US |
| dc.identifier.oclc | 15359541 | en_US |
| dc.identifier.aleph | 000274368 | en_US |
