Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2058
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Orlin, James B., 1953-. | - |
dc.contributor | Sloan School of Management. | - |
dc.date | 2003-04-29T04:56:10Z | - |
dc.date | 2003-04-29T04:56:10Z | - |
dc.date | 1983 | - |
dc.date.accessioned | 2013-05-31T22:14:44Z | - |
dc.date.available | 2013-05-31T22:14:44Z | - |
dc.date.issued | 2013-06-01 | - |
dc.identifier | Sloan W.P, No. 1484-83 | - |
dc.identifier | http://hdl.handle.net/1721.1/2058 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/jspui/handle/1721 | - |
dc.description | James B. Orlin. | - |
dc.description | "September 1983." | - |
dc.description | Bibliography: p. [15] | - |
dc.format | 14, [1] p. : ill. | - |
dc.format | 860059 bytes | - |
dc.format | application/pdf | - |
dc.language | eng | - |
dc.publisher | Massachusetts Institute of Technology | - |
dc.relation | Working paper (Sloan School of Management) ; 1484-83. | - |
dc.subject | HD28 .M414 no.1484-, 83 | - |
dc.subject | Simplexes (Mathematics) | - |
dc.subject | Algorithms | - |
dc.title | A polynomial-time parametric simplex algorithm for the minimum cost network flow 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.