Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2626
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Goldfarb, Donald. | - |
dc.contributor | Jin, Zhiying. | - |
dc.contributor | Orlin, James B., 1953-. | - |
dc.date | 2003-04-29T05:13:37Z | - |
dc.date | 2003-04-29T05:13:37Z | - |
dc.date | 1996 | - |
dc.date.accessioned | 2013-06-04T16:15:02Z | - |
dc.date.available | 2013-06-04T16:15:02Z | - |
dc.date.issued | 2013-06-05 | - |
dc.identifier | #3909-96 | - |
dc.identifier | http://hdl.handle.net/1721.1/2626 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
dc.description | by Donald Goldfarb, Zhiying Jin, James B. Orlin. | - |
dc.description | Includes bibliographical references (p. 15-16). | - |
dc.description | 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 | - |
dc.format | 16 p. | - |
dc.format | 1177143 bytes | - |
dc.format | application/pdf | - |
dc.language | eng | - |
dc.publisher | Sloan School of Management, Massachusetts Institute of Technology | - |
dc.relation | Working paper (Sloan School of Management) ; 3909-96. | - |
dc.subject | HD28 .M414 no.3909-96 | - |
dc.title | Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem | - |
Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.