Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5253Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Freund, Robert M. | - |
| dc.contributor | Vera, Jorge R. | - |
| dc.contributor | Massachusetts Institute of Technology. Operations Research Center | - |
| dc.date | 2004-05-28T19:30:13Z | - |
| dc.date | 2004-05-28T19:30:13Z | - |
| dc.date | 1997 | - |
| dc.date.accessioned | 2013-10-09T02:38:38Z | - |
| dc.date.available | 2013-10-09T02:38:38Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | OR 321-97 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5253 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | by R.M. Freund and J.R. Vera. | - |
| dc.description | "September 1997." | - |
| dc.description | Includes bibliographical references (p. 28-29). | - |
| dc.format | 29 p. : ill. | - |
| dc.format | 1638805 bytes | - |
| dc.format | application/pdf | - |
| dc.language | eng | - |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
| dc.relation | Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 321-97. | - |
| dc.subject | Q175.M41 O616 no.321-97 | - |
| dc.title | Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm | - |
| 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.