| dc.contributor | Goldfarb, Donald. | en_US |
| dc.contributor | Jin, Zhiying. | en_US |
| dc.contributor | Orlin, James B., 1953-. | en_US |
| dc.date.accessioned | 2003-04-29T05:13:37Z | |
| dc.date.available | 2003-04-29T05:13:37Z | |
| dc.date.issued | 1996 | en_US |
| dc.identifier.other | #3909-96 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/2626 | |
| dc.description | Includes bibliographical references (p. 15-16). | en_US |
| dc.description.sponsorship | Supported in part by NSF. DMS 94-14438 DMS 95-27124 Supported in part by DOE. DE-FG02-92ER25126 Supported as well by grants from UPS and ONR. N00014-96-1-0051 | en_US |
| dc.description.statementofresponsibility | by Donald Goldfarb, Zhiying Jin, James B. Orlin. | en_US |
| dc.format.extent | 16 p. | en_US |
| dc.format.extent | 1177143 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Sloan School of Management, Massachusetts Institute of Technology | en_US |
| dc.relation.ispartofseries | Working paper (Sloan School of Management) ; 3909-96. | en_US |
| dc.subject.lcc | HD28 .M414 no.3909-96 | en_US |
| dc.title | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem | en_US |
